1.Previous
3.Next

problem of determining whether a graph isomorphism exists between two graphs. Two graphs are isomorphic if one can be transformed into the other simply by renaming vertices. Consider these two problems:
* Graph Isomorphism: Is graph G₁ isomorphic to graph G₂?
* Subgraph Isomorphism: Is graph G₁ isomorphic to a subgraph of graph G₂?

1.Previous
3.Next