Planar Subgraph Isomorphism Revisited

Frederic Dorn
The problem of {\sc Subgraph Isomorphism} is defined as follows: Given a \emph{pattern} $H$ and a \emph{host graph} $G$ on $n$ vertices, does $G$ contain a subgraph that is isomorphic to $H$? Eppstein [SODA 95, J'GAA 99] gives the first linear time algorithm for subgraph isomorphism for a fixed-size pattern, say of order $k$, and arbitrary planar host graph, improving upon the $O(n^{\sqrt{k}})$-time algorithm when using the ``Color-coding'' technique of Alon et al [J'ACM 95]....
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.