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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Rebollo-Ruiz, I., & Graña, M. (2012). An empirical comparison of some approximate methods for graph coloring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7208 LNAI, pp. 600–609). https://doi.org/10.1007/978-3-642-28942-2_54
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
