 |
Free and accessible knowledge |
Habilitation à diriger des recherches
Décompositions arborescentes de graphes : calcul, approximations, heuristiques
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.
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
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