On the Tree-Width of Planar Graphs
GAVOILLE, Cyril
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
GAVOILLE, Cyril
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
< Reduce
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Language
en
Communication dans un congrès
This item was published in
European Conference on Combinatorics, Graph Theory and Applications (EuroComb), European Conference on Combinatorics, Graph Theory and Applications (EuroComb), EuroComb 2009, Bordeaux, France, 2009-09, Bordeaux. 2009-09, vol. 34C, p. 593-596
Elsevier
Keywords
tree-decomposition
planar
ANR Project
Décompositions des graphes et algorithmes - ANR-06-BLAN-0148
Origin
Hal imported