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 metadatas

https://tel.archives-ouvertes.fr/tel-00480655
Contributor : Ioan Todinca <>
Submitted on : Tuesday, May 4, 2010 - 4:35:20 PM
Last modification on : Thursday, January 17, 2019 - 3:06:04 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

351

Files downloads

1531