Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees

The problem of determining whether a k -connected partial k -tree is isomorphic to a subgraph of another partial k -tree is shown to be solvable in time O(n k+2 ) . The presented time-bounds considerably improve the corresponding bounds known in the literature. They rely in part on a new characterization of width-k tree-decomposition of k -connected partial k -trees.

[1]  Robin Thomas,et al.  On the complexity of finding iso- and other morphisms for partial k-trees , 1992, Discret. Math..

[2]  Naomi Nishimura,et al.  Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width , 1996, STACS.

[3]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

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

[5]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[6]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[7]  Andrzej Lingas,et al.  A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs , 1988, ICALP.

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

[9]  Naomi Nishimura,et al.  Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees , 1994, SWAT.

[10]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[11]  Hans L. Bodlaender,et al.  Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.

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

[13]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[14]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

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

[16]  Maciej M. Syslo,et al.  Plane Embeddings of 2-trees and Biconnected Partial 2-Trees , 1996, SIAM J. Discret. Math..

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

[18]  Jan van Leeuwen,et al.  Graph Algorithms , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.