Title of article
Approximating the treewidth of AT-free graphs Original Research Article
Author/Authors
Vincent Bouchitté، نويسنده , , Ioan Todinca، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
27
From page
11
To page
37
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.
Keywords
Graph algorithms , Treewidth , AT-free graphs
Journal title
Discrete Applied Mathematics
Serial Year
2003
Journal title
Discrete Applied Mathematics
Record number
885674
Link To Document