Subgraph Isomorphism in Planar Graphs and Related Problems

Details Subgraph Isomorphism in Planar Graphs and Related Problems Subgraph Isomorphism in Planar Graphs and Related Problems

1999-11-09

arxiv.org/abs/cs/9911003v1

J. Graph Algorithms & Applications 3(3):1-27, 1999

Computer Science

Data Structures and Algorithms

27 pages, 6 figures. A preliminary version of this paper appeared at the 6th ACM-SIAM Symp. Discrete Algorithms, 1995

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Subgraph Isomorphism in Planar Graphs and Related Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Subgraph Isomorphism in Planar Graphs and Related Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subgraph Isomorphism in Planar Graphs and Related Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276934