Treewidth computations II. Lower bounds

Authors:
Hans L. Bodlaender;Arie M. C. A. Koster
Affiliations:
Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands;Lehrstuhl II für Mathematik, RWTH Aachen University, Wüllnerstr. 5b, D-52062 Aachen, Germany
Venue:
Information and Computation
Year:
2011

Citing 27
Cited 6

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

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

BIT - Ellis Horwood series in artificial intelligence
Characterization and recognition of partial 3-trees

SIAM Journal on Algebraic and Discrete Methods
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Treewidth and Pathwidth of Permutation Graphs

SIAM Journal on Discrete Mathematics
Algorithms for VLSI layout based on graph width metrics

Algorithms for VLSI layout based on graph width metrics
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
The Structure and Number of Obstructions to Treewidth

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

Theoretical Computer Science
A Lower Bound for Treewidth and Its Consequences

WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
A New Lower Bound for Tree-Width Using Maximum Cardinality Search

SIAM Journal on Discrete Mathematics
Dynamic programming, tree-width and computation on graphical models

Dynamic programming, tree-width and computation on graphical models
A spectral lower bound for the treewidth of a graph and its consequences

Information Processing Letters
Two Short Proofs Concerning Tree-Decompositions

Combinatorics, Probability and Computing
A complete anytime algorithm for treewidth

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Girth and treewidth

Journal of Combinatorial Theory Series B
Planar Branch Decompositions I: The Ratcatcher

INFORMS Journal on Computing
On the maximum cardinality search lower bound for treewidth

Discrete Applied Mathematics
On exact algorithms for treewidth

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Boxicity and treewidth

Journal of Combinatorial Theory Series B
Treewidth Lower Bounds with Brambles

Algorithmica
Treewidth computations I. Upper bounds

Information and Computation
New lower and upper bounds for graph treewidth

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
A practical algorithm for finding optimal triangulations

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Constant-Degree Graph Expansions that Preserve Treewidth

Algorithmica
Degree-Based treewidth lower bounds

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Automata for monadic second-order model-checking

RP'11 Proceedings of the 5th international conference on Reachability problems
Finding good decompositions for dynamic programming on dense graphs

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Fixed-Parameter tractability of treewidth and pathwidth

The Multivariate Algorithmic Revolution and Beyond
On exact algorithms for treewidth

ACM Transactions on Algorithms (TALG)
Probabilistic inference and monadic second order logic

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On the stable degree of graphs

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

For several applications, it is important to be able to compute the treewidth of a given graph and to find tree decompositions of small width reasonably fast. Good lower bounds on the treewidth of a graph can, amongst others, help to speed up branch and bound algorithms that compute the treewidth of a graph exactly. A high lower bound for a specific graph instance can tell that a dynamic programming approach for solving a problem is infeasible for this instance. This paper gives an overview of several recent methods that give lower bounds on the treewidth of graphs.