Skip to Main content Skip to Navigation

Algorithmes exacts et exponentiels pour des problèmes de graphes

Abstract : Many algorithmic problems are « hard », in the sense of we do not know how to solve them in polynomialtime, either because they are NP-hard, or, for some enumeration problems, because the number of objectsto be produced is exponential. During the last fifteen years there was a growing interest in the design of exact algorithms to solve such problems as efficiently as possible. In the context of this thesis, we focus on the design of exponential exact algorithms for three hard problems. First, we study the optimisation problem Tropical Connected Set for which we describe an algorithm to solve it in the general case, then a faster branch-and-reduce algorithm to solve it on trees; the problem remains difficult even in this case. Secondly we focus on the Minimal Dominating Sets enumeration problem, for which we give algorithms to solve it on split, cobipartite and intervals graphs. As a byproduct, we establish upper bounds on the number of minimal dominating sets in such graphs. The last focus of this thesis concerns the Weak Roman Domination optimisation problem for which, given a graph, the goal is to build a weight function under some properties. The problem is NP-hard in general, but we give a linear greedy algorithm which computes such a function on interval graphs.
Complete list of metadata

Cited literature [77 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Tuesday, May 24, 2016 - 11:33:08 AM
Last modification on : Tuesday, September 6, 2022 - 3:04:40 AM


Version validated by the jury (STAR)


  • HAL Id : tel-01309228, version 2


Romain Letourneur. Algorithmes exacts et exponentiels pour des problèmes de graphes. Algorithme et structure de données [cs.DS]. Université d'Orléans, 2015. Français. ⟨NNT : 2015ORLE2022⟩. ⟨tel-01309228v2⟩



Record views


Files downloads