On the recursive largest first algorithm for graph colouring

Authors:
G. Palubeckis
Affiliations:
Department of Practical Informatics, Kaunas University of Technology, Kaunas, Lithuania
Venue:
International Journal of Computer Mathematics
Year:
2008

Citing 9
Cited 1

Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
New methods to color the vertices of a graph

Communications of the ACM
A GRASP for Coloring Sparse Graphs

Computational Optimization and Applications
Zero Knowledge and the Chromatic Number

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Cliques, holes and the vertex coloring polytope

Information Processing Letters
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

SIAM Review
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search

Note: Facet-inducing web and antiweb inequalities for the graph coloring polytope

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a reduction from the problem of colouring the vertices of the graph to the maximum independent set problem (MISP) showing that for an n-vertex graph G the sum of the chromatic number of G and the independence number of a graph derived from the complement of G is equal to n. We investigate the applicability of the MISP greedy algorithm to the graph colouring problem. We prove that the well-known Leighton RLF algorithm and an algorithm obtained by modifying the MISP greedy heuristic behave in exactly the same way.