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].
A large bibtex bibliography.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "subgraph isomorphism", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/subgraphiso.html