Computing branchwidth via efficient triangulations and blocks

Fedor V. Fomin (1) , Frédéric Mazoit (2, 3) , Ioan Todinca (4)

1 UiB - Department of Informatics [Bergen]
2 LIP - Laboratoire de l'Informatique du Parallélisme
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique
4 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

Minimal triangulations and potential maximal cliques are the main ingredients for a number of polynomial time algorithms on different graph classes computing the treewidth of a graph. Potential maximal cliques are also the main engine of the fastest so far, exact (exponential) treewidth algorithm. Based on the recent results of Mazoit, we define the structures that can be regarded as minimal triangulations and potential maximal cliques for branchwidth: efficient triangulations and blocks. We show how blocks can be used to construct an algorithm computing the branchwidth of a graph on n vertices in time (2√3)^n · n^O(1) .

Mots clés: graph; branchwidth; exponential time algorithm

Domaines: Mathématique discrète [cs.DM]

Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca. Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics, 2009, 157, pp.2726-2736. ⟨10.1016/j.dam.2008.08.009⟩. ⟨hal-00390623⟩