An empirical comparison of some approximate methods for graph coloring

Authors:
Israel Rebollo-Ruiz;Manuel Graña
Affiliations:
Computational Intelligence Group, University of the Basque Country, Spain;Computational Intelligence Group, University of the Basque Country, Spain
Venue:
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
Year:
2012

Citing 17
Cited 0

Flocks, herds and schools: A distributed behavioral model

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Almost all k-colorable graphs are easy to color

Journal of Algorithms
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
Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Simulated Annealing and Graph Colouring

Combinatorics, Probability and Computing
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Constructive generation of very hard 3-colorability instances

Discrete Applied Mathematics
GSA: A Gravitational Search Algorithm

Information Sciences: an International Journal
An adaptive flocking algorithm for performing approximate clustering

Information Sciences: an International Journal
A search space "cartography" for guiding graph coloring heuristics

Computers and Operations Research
Editorial: Hybrid intelligent algorithms and applications

Information Sciences: an International Journal
A swarm intelligence approach to the quadratic minimum spanning tree problem

Information Sciences: an International Journal
MTPSO algorithm for solving planar graph coloring problem

Expert Systems with Applications: An International Journal
Editorial: Editorial: New trends and applications on hybrid artificial intelligence systems

Neurocomputing
A modified Artificial Bee Colony algorithm for real-parameter optimization

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Graph Coloring Problem (GCP) is a classical NP-complete problem for which several approximate solution algorithms have been proposed: Brelaz algorithm, simulated annealing (SA), ant colony optimization (ACO). This paper reports empirical results on the GCP over a collection of graphs of some approximate solution algorithms. Among them, we test a recently proposed Gravitational Swarm Intelligence (GSI). Results in this benchmarking experiment show that GSI performance compares well to other methods.