Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs

We consider the problems of subgraph homeomorphism with fixed pattern graph, recognition, and subgraph isomorphism for some classes of planar graphs. Following the results of Robertson and Seymour on forbidden minor characterization, we show that the problems of fixed subgraph homeomorphism and recognition for any family of planar graphs closed under minor taking are in NC (i.e., they can be solved by an algorithm running in poly-log time using polynomial number of processors). We also show that the related subgraph isomorphism problem for biconnected outerplanar graphs is in NC. This is the first example of a restriction of subgraph isomorphism to a non-trivial graph family admitting an NC algorithm.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  Steven W. Reyner,et al.  An Analysis of a Good Algorithm for the Subtree Problem , 1977, SIAM J. Comput..

[3]  Takao Asano,et al.  An Approach to the Subgraph Homeomorphism Problem , 1985, Theor. Comput. Sci..

[4]  Michael J. Quinn,et al.  Parallel graph algorithms , 1984, CSUR.

[5]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[6]  Michael Randolph Garey,et al.  Johnson: "computers and intractability , 1979 .

[7]  Rüdiger Reischuk,et al.  Parallel Machines and their Communication Theoretical Limits , 1986, STACS.

[8]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Uzi Vishkin,et al.  Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..

[10]  Andrzej Lingas.  Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time , 1989, Theor. Comput. Sci..

[11]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[12]  Robert E. Tarjan,et al.  The Pebbling Problem is Complete in Polynomial Space , 1980, SIAM J. Comput..

[13]  F. Harary,et al.  Planar Permutation Graphs , 1967 .

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Selim G. Akl,et al.  Parallel Sorting Algorithms , 1985 .

[16]  Neil Robertson,et al.  Disjoint Paths—A Survey , 1985 .

[17]  M. Karpinski,et al.  Subtree Isomorphism and Bipartite Perfect Matching are Mutually $NC$-Reducible , 1986 .

[18]  S. Mitchell.  Linear algorithms to recognize outerplanar and maximal outerplanar graphs , 1979 .

[19]  S. Arnborg,et al.  Characterization and recognition of partial 3-trees , 1986 .

[20]  P. Seymour,et al.  Surveys in combinatorics 1985: Graph minors – a survey , 1985 .

[21]  Andrzej Lingas.  On partitioning polygons , 1985, SCG '85.

[22]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.

[23]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[24]  D. Matula.  Subtree Isomorphism in O(n5/2) , 1978 .

[25]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[26]  Maciej M. SysŁ.  The subgraph isomorphism problem for outerplanar graphs , 1982 .

[27]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[28]  Stephen A. Cook,et al.  The Classifikation of Problems which have Fast Parallel Algorithms , 1983, FCT.

[29]  Leonidas J. Guibas,et al.  Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).