Jump to content

Subgraph isomorphism problem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 24.101.83.241 (talk) at 05:39, 1 February 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The formal description of the decision problem is as follows.

Subgraph-Isomorphism(G1, G2)

Input: Two graphs G_1 and G_2.

Question: is G_1 isomorphic to a subgraph of G_2?

Retrieved from "https://en.wikipedia.org/w/index.php?title=Subgraph_isomorphism_problem&oldid=2276408"