Approximating the treewidth of AT-free graphs

Authors:
Vincent Bouchitté;Ioan Todinca
Affiliations:
LIP, Ecole normale supérieure de Lyon, 46 Allée d'Italie, 69364 Lyon Cedex 07, France;LIFO, Université d'Orléans, BP 6759, 45067 Orléans Cedex 2, France
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 7
Cited 3

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree

Journal of Algorithms
Treewidth and Pathwidth of Permutation Graphs

SIAM Journal on Discrete Mathematics
On treewidth and minimum fill-in of asteroidal triple-free graphs

Ordal'94 Selected papers from the conference on Orders, algorithms and applications
Characterizations and algorithmic applications of chordal graph embeddings

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Treewidth and Minimum Fill-in: Grouping the Minimal Separators

SIAM Journal on Computing
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking

WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science

Discovering treewidth

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Making life easier for firefighters

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
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.04

Visualization

Abstract

Using the specific structure of the minimal separators of AT-free graphs, we give a polynomial time algorithm that computes a triangulation whose width is no more than twice the treewidth of the input graph.