NIST

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 Black.

Entry modified 15 July 2019.
HTML page formatted Mon Jul 15 12:55:43 2019.

Cite this as:
Paul E. Black, "graph isomorphism", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 July 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/graphisomrph.html