graph isomorphism

(classic problem)

Definition: Determine if two graphs are isomorphic.

See also subgraph isomorphism, homeomorphic.

Author: PEB

Implementation

(C and Mathematica)

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 17 December 2004.
HTML page formatted Tue Dec 6 16:16:32 2011.

Cite this as:
Paul E. Black, "graph isomorphism", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/graphisomrph.html