A Polynomial Algorithm for Subisomorphism of Open Plane Graphs
Abstract
We address the problem of searching for a pattern in a plane graph, that is, a planar drawing of a planar graph. We define plane subgraph isomorphism and give a polynomial algorithm for this problem. We show that this algorithm may be used even when the pattern graph has holes.
Origin : Files produced by the author(s)
Loading...