The Collection of
Computer Science Bibliographies

Bibliography on Subgraph Isomorphism

[   About   |  Browse   |   Statistics   ]

Number of references:319Last update:May 18, 2001
Number of online publications:13Supported:Unknown
Most recent reference:2001

Information on the Bibliography

David Eppstein <eppstein @ ics . uci . edu> (email mangled to prevent spamming)
Dept. of Information and Computer Science
University of California
Irvine, CA 92717-3425
This file is a bibliography of papers on subgraph isomorphism algorithms and their applications.
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.
subgraph isomorphism, graph matching, largest common subgraph, subgraph homeomorphism, graph minors

Browsing the bibliography

Bibliographic Statistics

article(180), inproceedings(120), techreport(9), incollection(4), book(2), misc(2), phdthesis(1), unpublished(1)
title(319), author(318), year(316), pages(294), abstract(253), volume(197), journal(178), publisher(135), booktitle(125), number(63), series(45), url(11), month(10), institution(9), comment(8), note(8), eprint(5), editor(4), address(3), review(2), reviews(2), site(2), howpublished(1), keywords(1), school(1), summary(1), text(1), type(1)
Distribution of publication dates:
Distribution of publication dates

Valid XHTML 1.1!  Valid CSS!