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 - Special issue: The second international colloquium, "journées de l'informatique messine"
  • Year:
  • 2003

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.