Skip to Main content Skip to Navigation
Theses

Méthodes exactes et approchées par partition en cliques de graphes

Abstract : This thesis takes place in the project ToDo 2 funded by the french National Research Agency. We deal with the resolution of two graph problems, by exact and approximation methods. For the sake of compromise between runtime and quality of the solutions, we propose a new approach by partitioning the vertices of the graph into cliques, which aims (1) to solve problems quickly with exact algortihms and (2) to ensure the quality if results with approximation algorithms. We combine our approach with filtering techniques and heuristic list. To complete this theoretical work, we implement our algorithms and compared with those existing in the literature. At the first step, we discuss the problem of independent dominating of minimum size. We solve this problem accurately and prove that there are special graphs where the problem is 2-approximable. In the second step, we solve by an exact algorithm and an approximation algorithm, the vertex cover problem and the connected vertex cover problem. Then at the end of this thesis, we extend our work to the problems in graphs including conflicts between vertices.
Complete list of metadatas

Cited literature [61 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00921589
Contributor : Abes Star :  Contact
Submitted on : Friday, December 20, 2013 - 4:22:10 PM
Last modification on : Tuesday, December 1, 2020 - 11:20:02 AM
Long-term archiving on: : Friday, March 21, 2014 - 9:05:36 AM

File

PHAN_2013CLF22396.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00921589, version 1

Citation

Raksmey Phan. Méthodes exactes et approchées par partition en cliques de graphes. Autre [cs.OH]. Université Blaise Pascal - Clermont-Ferrand II, 2013. Français. ⟨NNT : 2013CLF22396⟩. ⟨tel-00921589⟩

Share

Metrics

Record views

752

Files downloads

9133