Fixed-Parameter tractability of treewidth and pathwidth

Authors:
Hans L. Bodlaender
Affiliations:
-
Venue:
The Multivariate Algorithmic Revolution and Beyond
Year:
2012

Citing 107
Cited 1

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

BIT - Ellis Horwood series in artificial intelligence
Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Graph minors. VI. Disjoint paths across a disc

Journal of Combinatorial Theory Series B
Characterization and recognition of partial 3-trees

SIAM Journal on Algebraic and Discrete Methods
Linear-time computation of optimal subgraphs of decomposable graphs

Journal of Algorithms
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Nonconstructive advances in polynomial-time complexity

Information Processing Letters
Nonconstructive tools for proving polynomial-time decidability

Journal of the ACM (JACM)
Graph minors. VII. Disjoint paths on a surface

Journal of Combinatorial Theory Series B
Linear time algorithms for NP-hard problems restricted to partial k-trees

Discrete Applied Mathematics
On search decision and the efficiency of polynomial-time algorithms

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Graph minors. IX. Disjoint crossed paths

Journal of Combinatorial Theory Series B
Graph minors. IV. Tree-width and well-quasi-ordering

Journal of Combinatorial Theory Series B
Graph minors. VIII. A Kuratowski theorem for general surfaces

Journal of Combinatorial Theory Series B
The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

Journal of Algorithms
The monadic second-order logic of graphs V: on closing the gap between definability and recognizability

MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
Easy problems for tree-decomposable graphs

Journal of Algorithms
Algorithms finding tree-decompositions of graphs

Journal of Algorithms
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Quickly excluding a forest

Journal of Combinatorial Theory Series B
Finding approximate separators and computing tree width quickly

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On well-partial-order theory and its application to combinatorial problems of VLSI design

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

Information Processing Letters
The pathwidth and treewidth of cographs

SIAM Journal on Discrete Mathematics
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
An algebraic theory of graph reduction

Journal of the ACM (JACM)
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree

Journal of Algorithms
Parametric problems on graphs of bounded tree-width

Journal of Algorithms
Graph minors. XI.: circuits on a surface

Journal of Combinatorial Theory Series B
Improved self-reduction algorithms for graphs with bounded treewidth

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Quickly excluding a planar graph

Journal of Combinatorial Theory Series B
Regular Article: On search, decision, and the efficiency of polynomial-time algorithms

Proceedings of the 30th IEEE symposium on Foundations of computer science
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Graph minors XIV: extending an embedding

Journal of Combinatorial Theory Series B
Graph minors. XII: distance on a surface

Journal of Combinatorial Theory Series B
Efficient parallel algorithms for graphs of bounded tree-width

Journal of Algorithms
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
The complexity of subgraph isomorphism for classes of partial k-trees

Theoretical Computer Science
Graph minors XV: giant steps

Journal of Combinatorial Theory Series B
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Shortest paths in digraphs of small treewidth. Part II: optimal parallel algorithms

ESA '95 Selected papers from the third European symposium on Algorithms
Parallel Algorithms with Optimal Speedup for Bounded Treewidth

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

Theoretical Computer Science
An algorithm for the Tutte polynomials of graphs of bounded treewidth

Discrete Mathematics
Characterizing multiterminal flow networks and computing flows in networks of small treewidth

Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Highly connected sets and the excluded grid theorem

Journal of Combinatorial Theory Series B
On computing graph minor obstruction sets

Theoretical Computer Science
Graph minors

Journal of Combinatorial Theory Series B
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs

Theoretical Computer Science
A comparison of structural CSP decomposition methods

Artificial Intelligence
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Algorithms for generalized vertex-rankings of partial k-trees

Theoretical Computer Science - computing and combinatorics
Reduction algorithms for graphs of small treewidth

Information and Computation
Introduction to algorithms

Introduction to algorithms
Listing all potential maximal cliques of a graph

Theoretical Computer Science
Counting H-colorings of partial k-trees

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
Treewidth: Algorithmoc Techniques and Results

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Finding Minimal Forbidden Minors Using a Finite Congruence

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Dynamic Algorithms for Graphs of Bounded Treewidth

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Recognizability Equals Definability for Partial k-Paths

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The Treewidth of Java Programs

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design

AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
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
Linear algorithms on k-terminal graphs

Linear algorithms on k-terminal graphs
Graph minors. XVI. excluding a non-planar graph

Journal of Combinatorial Theory Series B
Graph minors. XVIII. tree-decompositions and well-quasi-ordering

Journal of Combinatorial Theory Series B
Graph Minors. XIX. Well-quasi-ordering on a surface

Journal of Combinatorial Theory Series B
Algorithm Design

Algorithm Design
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Faster placement of hydrogens in protein structures by dynamic programming

Journal of Experimental Algorithmics (JEA)
Safe Reduction Rules for Weighted Treewidth

Algorithmica
New upper bounds on the decomposability of planar graphs

Journal of Graph Theory
An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Improved Approximation Algorithms for Minimum Weight Vertex Separators

SIAM Journal on Computing
Solving problems on recursively constructed graphs

ACM Computing Surveys (CSUR)
Derivation of algorithms for cutwidth and related graph layout parameters

Journal of Computer and System Sciences
Graph minors. XXI. Graphs with unique linkages

Journal of Combinatorial Theory Series B
On Two Techniques of Combining Branching and Treewidth

Algorithmica
On problems without polynomial kernels

Journal of Computer and System Sciences
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms

SIAM Journal on Discrete Mathematics
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Cutwidth I: A linear time fixed parameter algorithm

Journal of Algorithms
Cutwidth II: Algorithms for partial w-trees of bounded degree

Journal of Algorithms
Approximation Algorithms for Treewidth

Algorithmica
Treewidth computations I. Upper bounds

Information and Computation
(Meta) Kernelization

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Graph minors XXIII. Nash-Williams' immersion conjecture

Journal of Combinatorial Theory Series B
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width

Discrete Applied Mathematics
Dynamic programming and planarity: Improved tree-decomposition based algorithms

Discrete Applied Mathematics
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs

Journal of Discrete Algorithms
Bidimensionality and kernels

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Faster algorithms on branch and clique decompositions

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Logspace Versions of the Theorems of Bodlaender and Courcelle

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
On the complexity of some colorful problems parameterized by treewidth

Information and Computation
Treewidth computations II. Lower bounds

Information and Computation
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms

Algorithmica
An experimental evaluation of treewidth at most four reductions

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Preprocessing for treewidth: a combinatorial analysis through kernelization

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Linear kernels for (connected) dominating set on H-minor-free graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Known algorithms on graphs of bounded treewidth are probably optimal

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On moderately exponential time for SAT

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

A basic parameterized complexity primer

The Multivariate Algorithmic Revolution and Beyond

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this survey, a number of results on the fixed-parameter tractability of treewidth and pathwidth are discussed. Some emphasis is placed on older results, and proofs that show that treewidth and pathwidth are fixed-parameter tractable. Also, a linear-time algorithm for testing if a graph has pathwidth at most some given constant is discussed in more detail.