Skip to Main content Skip to Navigation

Heuristic Algorithms for Graph Coloring Problems

Abstract : This thesis concerns four NP-hard graph coloring problems, namely, graph coloring (GCP), equitable coloring (ECP), weighted vertex coloring (WVCP) and k-vertex-critical subgraphs (k-VCS). These problems are extensively studied in the literature not only for their theoretical intractability, but also for their real-world applications in many domains. Given that they belong to the class of NP-hard problems, it is computationally difficult to solve them exactly in the general case. For this reason, this thesis is devoted to developing effective heuristic approaches to tackle these challenging problems. We develop a reduction memetic algorithm (RMA) for the graph coloring problem, a feasible and infeasible search algorithm (FISA) for the equitable coloring problem, an adaptive feasible and infeasible search algorithm (AFISA) for the weighted vertex coloring problem and an iterated backtrack-based removal (IBR) algorithm for the k-VCS problem. All these algorithms were experimentally evaluated and compared with state-of-the-art methods.
Complete list of metadata

Cited literature [141 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Wednesday, May 22, 2019 - 1:29:08 PM
Last modification on : Monday, June 1, 2020 - 4:54:02 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02136810, version 1


Wen Sun. Heuristic Algorithms for Graph Coloring Problems. Data Structures and Algorithms [cs.DS]. Université d'Angers, 2018. English. ⟨NNT : 2018ANGE0027⟩. ⟨tel-02136810⟩



Record views


Files downloads