Subgraph Isomorphism in Planar Graphs and Related Problems
数据结构与算法
2007-05-23 v1
摘要
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic programming within each piece. The same methods can be used to solve other planar graph problems including connectivity, diameter, girth, induced subgraph isomorphism, and shortest paths.
引用
@article{arxiv.cs/9911003,
title = {Subgraph Isomorphism in Planar Graphs and Related Problems},
author = {David Eppstein},
journal= {arXiv preprint arXiv:cs/9911003},
year = {2007}
}
备注
27 pages, 6 figures. A preliminary version of this paper appeared at the 6th ACM-SIAM Symp. Discrete Algorithms, 1995