On treewidth approximations

Authors:
V. Bouchitté;D. Kratsch;H. Müller;I. Todinca
Affiliations:
LIP-Ecole normale supérieure de Lyon, 46 Allée d'Italie, 69364, Lyon Cedex 07, France;LITA-Université de Metz, Ile du Saulcy, 57045, Metz Cedex 01, France;School of Computing, University of Leeds, Leeds LS2 9JT, UK;LIFO-Université d'Orléans, BP 6759, 45067, Orléans Cedex 2, France
Venue:
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Year:
2004

Citing 10
Cited 15

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree

Journal of Algorithms
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
Fast Approximate Graph Partitioning Algorithms

SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

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
Efficient Approximation for Triangulation of Minimum Treewidth

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Using expander graphs to find vertex connectivity

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Tree decomposition and discrete optimization problems: A survey

Cybernetics and Systems Analysis
Solving problems on recursively constructed graphs

ACM Computing Surveys (CSUR)
An exact almost optimal algorithm for target set selection in social networks

Proceedings of the 10th ACM conference on Electronic commerce
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Treewidth computations I. Upper bounds

Information and Computation
Kernel bounds for disjoint cycles and disjoint paths

Theoretical Computer Science
Greedy routing in tree-decomposed graphs

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
Nondeterministic graph searching: from pathwidth to treewidth

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations 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
Treewidth governs the complexity of target set selection

Discrete Optimization
Computing all-pairs shortest paths by leveraging low treewidth

Journal of Artificial Intelligence Research
Computability of width of submodular partition functions

European Journal of Combinatorics
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

We introduce a natural heuristic for approximating the treewidth of graphs. We prove that this heuristic gives a constant factor approximation for the treewidth of graphs with bounded asteroidal number. Using a different technique, we give a O(log k) approximation algorithm for the treewidth of arbitrary graphs, where k is the treewidth of the input graph.