论文信息 - The algorithmic theory of treewidth

The algorithmic theory of treewidth

Abstract Treewidth is a graph measure with several applications. In this abstract, it is discussed that many otherwise intractable problems become polynomial or linear time solvable when restricted to graphs of bounded treewidth, and some other algorithmic results that use treewidth (e.g., applied to planar graphs) are discussed.

Hans L. Bodlaender | H. Bodlaender

[1] David Eppstein. Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

[2] Denis Lapoire,et al. Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width , 1998, STACS.

[3] David Eppstein,et al. The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

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

[5] Rolf Niedermeier,et al. Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems , 2000, SWAT.

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

[7] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8] Michael R. Fellows,et al. Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.

[9] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[10] Hans L. Bodlaender,et al. Treewidth: Algorithmic Techniques and Results , 1997, MFCS.

[11] Hans L. Bodlaender,et al. A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..