Complétions d'intervalles minimales

Abstract : Pathwidth and treewidth have been introduced by Robertson and Seymour in their work on graph minors. Informally, pathwidth (resp. treewidth) measures the "distance" between a given graph and the class of paths (resp. trees). Given an arbitrary graph G=(V,E), an interval graph H=(V,F) containing G is called an interval completion of G. Computing pathwidth comes to computing an interval completion of minimum cliquesize of the input graph. Unfortunately the pathwidth problem is NP-hard. We focus on minimal interval completions of G, that is interval completions H such that no proper subgraph of H is an interval completion of G. We give several algorithms for computing minimal interval completions of an input graph, an also an algorithm computing a minimal proper interval completion. Eventually, we show that pathwidth can be polinomially computed for circular-arc graphs.
Document type :
Theses
Complete list of metadatas

Cited literature [111 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00480669
Contributor : Ioan Todinca <>
Submitted on : Tuesday, May 4, 2010 - 7:39:15 PM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM
Long-term archiving on : Thursday, September 16, 2010 - 12:46:16 PM

Identifiers

  • HAL Id : tel-00480669, version 1

Citation

Karol Suchan. Complétions d'intervalles minimales. Computer Science [cs]. Université d'Orléans, 2006. English. ⟨tel-00480669⟩

Share

Metrics

Record views

312

Files downloads

172