Linear time algorithms for NP-hard problems restricted to partial k-trees

Abstract We present and illustrate by a sequence of examples an algorithm paradigm for solving NP- hard problems on graphs restricted to partial graphs of k -trees and given with an embedding in a k -tree. Such algorithms, linear in the size of the graph but exponential or superexponential in k , exist for most NP-hard problems that have linear time algorithms for trees. The examples used are optimization problems involving independent sets, dominating sets, graph coloring, Hamiltonian circuits, network reliability and minimum vertex deletion forbidden subgraphs. The results generalize previous results for series-parallel graphs, bandwidth-constrained graphs, and non- serial dynamic programming.

[1]  S. Arnborg.  Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation , 1978, IEEE Transactions on Reliability.

[2]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[3]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[4]  Detlef Seese,et al.  Tree-partite graphs and the complexity of algorithms , 1985, FCT.

[5]  A. Rosenthal.  Computing the Reliability of Complex Networks , 1977 .

[6]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[7]  Eugene L. Lawler,et al.  Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs , 1987, J. Algorithms.

[8]  Ivan Hal Sudborough,et al.  Bandwidth constrained NP-Complete problems , 1981, STOC '81.

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

[10]  Arnon Rosenthal.  Dynamic Programming is Optimal for Nonserial Optimization Problems , 1982, SIAM J. Comput..

[11]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

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

[13]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

[14]  D. Corneil,et al.  A dynamic programming approach to the dominating set problem on k trees , 1987 .

[15]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[16]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[17]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..