2 research outputs found
Parallel Algorithms for the Subgraph Homeomorphism Problem
The subgraph homeomorphism problem for a fixed graph is stated as follows: given a graph , determine whether has a subgraph homeomorphic to , and obtain it. We study the parallel complexity of this problem for various pattern graphs and present fast algorithms for versions of this problem. We also present an efficient algorithm to check if a given graph is outer-planar and to obtain its forbidden homeomorphs or if it is not