Maximum packing for k-connected partial k-trees in polynomial time

Abstract The problem of determining the maximum number of node-disjoint subgraphs of a partial k -tree H on n H nodes that are isomorphic to a k -connected partial k -tree G on n G nodes is shown to be solvable in time O(n G k+1 n H +n H k ) .

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

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

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

[4]  Andrzej Lingas,et al.  Maximum Packing for Biconnected Outerplanar Graphs , 1997, TAPSOFT.

[5]  Andrzej Lingas,et al.  Maximum packing for biconnected outerplanar graphs , 2000, Discret. Appl. Math..

[6]  Andrzej Lingas,et al.  Maximum Tree-Packing in Time O(n5/2) , 1995, COCOON.

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

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

[9]  Francine Berman,et al.  Generalized Planar Matching , 1990, J. Algorithms.

[10]  Andrzej Lingas.  Maximum Tree-Packing in Time O(n5/2) , 1997, Theor. Comput. Sci..

[11]  David G. Kirkpatrick,et al.  On the completeness of a generalized matching problem , 1978, STOC.

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

[13]  Marek Karpinski,et al.  Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching , 1989, Inf. Process. Lett..

[14]  David G. Kirkpatrick,et al.  On Generalized Matching Problems , 1981, Inf. Process. Lett..

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

[16]  Bengt Aspvall,et al.  Memory Requirements for Table Computations in Partial k-tree Algorithms , 1998, SWAT.

[17]  Naomi Nishimura,et al.  The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees , 1996, Theor. Comput. Sci..

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

[19]  Donald J. ROSE,et al.  On simple characterizations of k-trees , 1974, Discret. Math..

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

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

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

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

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

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