NIST

subgraph isomorphism

(classic problem)

Definition: Decide if there is a subgraph of one graph which is isomorphic to another graph.

Note: This is known to be NP-complete. After [ATCH99, page 6-21].

Author: PEB

More information

A large bibtex bibliography.


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 17 December 2004.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "subgraph isomorphism", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/subgraphiso.html