David Eppstein - Publications

Subgraph isomorphism

Subgraph isomorphism is a very general form of pattern matching in which one attempts to find a target graph as a subgraph of a larger input graph. It is NP-complete, but it has many applications and algorithms are known for many special cases. See also my bibliography of subgraph isomorphism algorithms and applications, which I collected for my SODA 95 paper.

Graph TheoryPublicationsDavid EppsteinTheory GroupInf. & Comp. Sci.UC Irvine

Semi-automatically filtered from a common source file.