Skip to Main content Skip to Navigation

Décompositions de graphes : quelques limites et obstructions

Mathieu Chapelle 1
LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
Abstract : Graphs decompositions of small width are usually used to solve efficiently problems which are difficult in general. In this thesis, we focus on some limits of these decompositions, and the construction of some obstructions certifying a large width. First, we give a generic algorithm unifying obstructions' construction for several graph widths, in XP time when parameterized by the considered width. In particular, it gives the first algorithm computing efficiently an obstruction to tree-width in time O^{tw+4}. Secondly, we study the parameterized complexity of [Sigma,Rho]-Dominating Set, a generalization of some domination problems characterized by two sets of integers Sigma and Rho. All known studies focused only on cases where this problem is FPT when parameterized by tree-width. In this work, we show that there are some cases where the problem is no longer FPT, and become W[1]-hard instead. Finally, we study the computational complexity of a new coloration problem, named k-Additive Coloring, which combines both graph theory and number theory. We show that this new problem is NP-complete for any fixed number k >= 4, while it can be solved in polynomial time on trees for any k.
Complete list of metadatas

Cited literature [131 references]  Display  Hide  Download
Contributor : Mathieu Chapelle <>
Submitted on : Monday, March 5, 2012 - 5:35:57 PM
Last modification on : Friday, October 23, 2020 - 4:38:11 PM
Long-term archiving on: : Wednesday, December 14, 2016 - 10:40:07 AM


  • HAL Id : tel-00659666, version 2


Mathieu Chapelle. Décompositions de graphes : quelques limites et obstructions. Complexité [cs.CC]. Université d'Orléans, 2011. Français. ⟨tel-00659666v2⟩



Record views


Files downloads