Approximating the Treewidth of AT-Free Graphs

Authors:
Vincent Bouchitté;Ioan Todinca
Affiliations:
-;-
Venue:
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2000

Citing 9
Cited 0

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
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
Listing All Potential Maximal Cliques of a Graph

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
Minimal Triangulations for Graphs with "Few" Minimal Separators

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Treewidth and minimum fill-in of weakly triangulated graphs

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

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.