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

@article{Arnborg1989LinearTA,
  title={Linear time algorithms for NP-hard problems restricted to partial k-trees},
  author={Stefan Arnborg and Andrzej Proskurowski},
  journal={Discret. Appl. Math.},
  year={1989},
  volume={23},
  pages={11-24}
}
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems
TLDR
This work gives a formal description of vertex subset optimization problems in a class that includes several variants of domination, independence, efficiency and packing, and gives algorithms for any problem in this class.
Algorithms for Graphs of (Locally) Bounded Treewidth
TLDR
This thesis demonstrates how the subgraph isomorphism problem on graphs of locally bounded treewidth can be solved in polynomial time, when the source graph is a log-bounded fragmentation graph and has constant diameter.
Combinatorial Optimization on Graphs of Bounded Treewidth
TLDR
The concepts of treewidth and tree decompositions are introduced, and the technique with the Weighted Independent Set problem is illustrated, to survey some of the latest developments.
Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth
TLDR
Two novel generic schemes for approximation algorithms for optimization NP-hard graph problems constrained to partial k-trees are presented, leading to best known polynomial-time approximation guarantees for some basic optimization problems.
Linear-Time Algorithms for Partial \boldmathk -Tree Complements
TLDR
A variation of Monadic Second-order (or MS) logic is introduced in which, if a graph-problem can be defined over the class of partial k -tree complements, then there is a linear-time algorithm to solve that problem over Partial k - tree complements.
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
  • R. Borie
  • Computer Science, Mathematics
    Algorithmica
  • 2005
TLDR
New general approaches are developed to obtain two new families of related polynomial-time algorithms for (1) packing, partitioning, and covering problems and (2) multiset and multiproperty problems.
Complexity of finding embeddings in a k -tree
TLDR
This work determines the complexity status of two problems related to finding the smallest number k such that a given graph is a partial k-tree and presents an algorithm with polynomially bounded (but exponential in k) worst case time complexity.
A comparison of two approaches for polynomial time algorithms computing basic graph parameters
TLDR
This paper gives polynomial time algorithms for computing the four basic graph parameters independence number, clique number, chromatic number, and clique covering number on a given tree structure of graphs of bounded tree-width and graph of bounded clique-width in polynometric time.
Using Genetic Algorithms to Find Good K-Tree Subgraphs
TLDR
A genetic algorithm which seeks a heuristic optimum solution by generating an evolving population of k-tree subgraphs by computing an exact optimum over the subgraph, which provides a feasible solution over the original graph.
Efficient Computations in Tree-Like Graphs
Efficient Computations in Tree-Like Graphs. Many discrete optimization problems are both very difficult and important in a range of applications in engineering, computer science and operations
...
...

References

SHOWING 1-10 OF 16 REFERENCES
Complexity of finding embeddings in a k -tree
TLDR
This work determines the complexity status of two problems related to finding the smallest number k such that a given graph is a partial k-tree and presents an algorithm with polynomially bounded (but exponential in k) worst case time complexity.
A dynamic programming approach to the dominating set problem on k trees
TLDR
This paper extends the normal paradigm of dynamic programming to allow a polynomial number of optimal solutions to be computed for each subproblem to yield aPolynomial time algorithm for the dominating set problem on k-trees, where k is fixed.
Graph Minors. II. Algorithmic Aspects of Tree-Width
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
TLDR
This paper presents ways for constructing efficient algorithms for finding a minimum coloring, a minimum covering by cliques, a maximum clique, and a maximum independent set given a chordal graph.
Complement reducible graphs
Computing the Reliability of Complex Networks
TLDR
A decomposition procedure for evaluating the reliability of a network whose elements fail independently with known probabilities is presented and it is shown that computing network reliability is NP-hard, so that efficiency in special cases is all that can be achieved.
Characterization and recognition of partial 3-trees
TLDR
A set of confluent graph reductions is found such that any graph can be reduced to the empty graph if and only if it is a subgraph of a 3-tree.
...
...