Treewidth: structure and algorithms

Authors:
Hans L. Bodlaender
Affiliations:
Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
Venue:
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Year:
2007

Citing 50
Cited 9

Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey

BIT - Ellis Horwood series in artificial intelligence
Efficient algorithms for optimization and selection on series-parallel graphs

SIAM Journal on Algebraic and Discrete Methods
Characterization and recognition of partial 3-trees

SIAM Journal on Algebraic and Discrete Methods
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Characteristics of graph languages Generated by edge replacement

Theoretical Computer Science
Nonconstructive advances in polynomial-time complexity

Information Processing Letters
Nonconstructive tools for proving polynomial-time decidability

Journal of the ACM (JACM)
Linear time algorithms for NP-hard problems restricted to partial k-trees

Discrete Applied Mathematics
The complexity of graph languages generated by hyperedge replacement

Acta Informatica
The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
Easy problems for tree-decomposable graphs

Journal of Algorithms
Algorithms finding tree-decompositions of graphs

Journal of Algorithms
Deterministic decomposition of recursive graph classes

SIAM Journal on Discrete Mathematics
The vertex separation number of a graph equals its path-width

Information Processing Letters
Monadic second-order evaluations on tree-decomposable graphs

Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
An algebraic theory of graph reduction

Journal of the ACM (JACM)
The vertex separation and search number of a graph

Information and Computation
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
On Linear Recognition of Tree-Width at Most Four

SIAM Journal on Discrete Mathematics
On interval routing schemes and treewidth

Information and Computation
Characterizations and algorithmic applications of chordal graph embeddings

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Listing all Minimal Separators of a Graph

SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Linear-time computability of combinatorial problems on series-parallel graphs

Journal of the ACM (JACM)
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems

Journal of the ACM (JACM)
Listing all potential maximal cliques of a graph

Theoretical Computer Science
Treewidth and Minimum Fill-in: Grouping the Minimal Separators

SIAM Journal on Computing
Algorithms for Vertex Partitioning Problems on Partial k-Trees

SIAM Journal on Discrete Mathematics
Efficient Algorithms on Context-Free Graph Grammars

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
May we introduce to you: hyperedge replacement

Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time

Journal of Algorithms
Combinatorial optimization on series-parallel graphs: algorithms and complexity

Combinatorial optimization on series-parallel graphs: algorithms and complexity
Linear algorithms on k-terminal graphs

Linear algorithms on k-terminal graphs
Recursively constructed graph families: membership and linear algorithms

Recursively constructed graph families: membership and linear algorithms
Two Short Proofs Concerning Tree-Decompositions

Combinatorics, Probability and Computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
A complete anytime algorithm for treewidth

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Algorithm Design

Algorithm Design
Planar Branch Decompositions I: The Ratcatcher

INFORMS Journal on Computing
Planar Branch Decompositions II: The Cycle Method

INFORMS Journal on Computing
On exact algorithms for treewidth

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Treewidth: characterizations, applications, and computations

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A branch and bound algorithm for exact, upper, and lower bounds on treewidth

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Optimal branch-decomposition of planar graphs in O(n3) time

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Treewidth lower bounds with brambles

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Discovering treewidth

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Improved exponential-time algorithms for treewidth and minimum fill-in

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Minimal interval completion through graph exploration

Theoretical Computer Science
Compact labelings for efficient first-order model-checking

Journal of Combinatorial Optimization
A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Improved steiner tree algorithms for bounded treewidth

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
On the algorithmic effectiveness of digraph decompositions and complexity measures

Discrete Optimization
Improved Steiner tree algorithms for bounded treewidth

Journal of Discrete Algorithms
Drawing planar 3-trees with given face areas

Computational Geometry: Theory and Applications
Robust geometric spanners

Proceedings of the twenty-ninth annual symposium on Computational geometry
Fast hamiltonicity checking via bases of perfect matchings

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys some aspects of the graph theoretic notion of treewidth. In particular, we look at the interaction between different characterizations of the notion, and algorithms and algorithmic applications.