HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Habilitation à diriger des recherches

Décompositions arborescentes de graphes : calcul, approximations, heuristiques

Abstract : We study different aspects of tree and path decompositions of graphs and the related parameters (tree-width, pathwidth). We give polynomial amgorithms for the treewidth of graphs with polynomially many minimal separators, as well as exact and approximate algorithms for the general case. We investigate path decompositions and pathwidth from a heuristic point of view, through the notion of minimal interval completions, and we give a polynomial algorithm for the pathwidth of circular-arc graphs.
Document type :
Habilitation à diriger des recherches
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-00480655
Contributor : Ioan Todinca Connect in order to contact the contributor
Submitted on : Tuesday, May 4, 2010 - 4:35:20 PM
Last modification on : Tuesday, October 12, 2021 - 5:20:29 PM
Long-term archiving on: : Thursday, September 16, 2010 - 1:09:08 PM

Identifiers

  • HAL Id : tel-00480655, version 1

Collections

Citation

Ioan Todinca. Décompositions arborescentes de graphes : calcul, approximations, heuristiques. Informatique [cs]. Université d'Orléans, 2006. ⟨tel-00480655⟩

Share

Metrics

Record views

169

Files downloads

1425