|
The Collection of Computer Science Bibliographies |
|
| Up: Bibliographies on Theory/Foundations of Computer Science | Collection Home |
[ About | Browse | Statistics ]
| Number of references: | 319 | Last update: | May 18, 2001 |
|---|---|---|---|
| Number of online publications: | 11 | Supported: | Unknown |
| Most recent reference: | 2001 |
| Information on the Bibliography |
Subgraph isomorphism is an important and very general form of exact pattern matching. Theoretically, subgraph isomorphism is a common generalization of many important graph problems including finding Hamiltonian paths, cliques, matchings, girth, and shortest paths. Variations of subgraph isomorphism have also been used to model such varied practical problems as molecular structure comparison, integrated circuit testing, microprogrammed controller optimization, analysis of Chinese ideographs, robot motion planning, semantic network retrieval, and polyhedral object recognition.
| Browsing the bibliography |
| Bibliographic Statistics |
|
Please direct comments regarding the bibliography collection
to <liinwwwa@ira.uka.de>.
This page is part of the Computer
Science Bibliography Collection. |