A fast and simple local search for graph coloring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1668, Issue , 1999, Pages 316-329

  Caramia, Massimiliano ^a   DellOlmo, Paolo ^b  

^a Dipartimento di Informatica Sistemi e Produzione University of Rome   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL SEARCH (OPTIMIZATION);

GRAPH COLORINGS; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; RANDOM GRAPHS;

GRAPH THEORY;

EID: 84957059280     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48318-7_25     Document Type: Conference Paper

References (32)

1. Bianco, L., Caramia, M., and Dell’Olmo, P.: Solving a Preemptive Scheduling Problem using Coloring Technique, in Project Scheduling. Recent Models, Algorithms and Applications, J. Weglarz (Ed.) Kluwer Academic Publishers (1998).
2. Blazewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., and Weglarz, J.: Scheduling in Computer and Manufacturing Processes, Springer (1996).
3. Brelaz, D., “New methods to color the vertices of a graph”: Communications of the ACM 22 (1979), 251–256.
4. Cangalovic, M., and Schreuder, J.: “Exact coloring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths”, EJOR 51 (1991) 248–258.
5. Chams, M., Hertz, A., and de Werra, D.: “Some experiments with simulated annealing for coloring graphs”, EJOR 32 (1987), 260–266.
6. Coffman, E. G.: “An Introduction to Combinatorial Models of Dynamic Storage Allocation”, SIAM Review 25 (1983), 311–325.
7. Culberson’s Coloring WEB site:
8. Uniqueness of colorability and colorability of planar
9. Dailey, D. P.: “Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete”, Discrete Mathematics 30 (1980), 289–293.
10. DIMACS ftp site for benchmark graphs
11. site for benchmark
12. DIMACS ftp site for benchmark machines:
13. hine
14. Eiben, A. E., Van Der Hauw, J. K., and Van Hemert, J. I.: “Graph Coloring with Adaptive Evolutionary Algorithms” Journal of Heuristics 4 (1998), 25–46.
15. Fleurent, C., and Ferland, J. A.: “Genetic and hybrid algorithms for graph coloring”, Annals of Operations Research, 63 (1995), 437-461.
16. Fleurent, C., and Ferland, J. A.: “Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique and Satisfiability”, Volume 26 of Discrete Mathematics and Theoretical Computer Science AMS (1996), 619-652.
17. Text Box: le Local Search for Graph Coloring 329 Gardner, M.: The Unexpected Hanging and Other Mathematical Diversions, Simon and Schuster, New York, (1969).
18. Garey, M. R., and Johnson, D. S.: “The complexity of near-optimal graph coloring”, Journal of the ACM 23 (1976), 43–49.
19. Garey, M. R., Johnson, D. S., and Stockmeyer, L.: “Some simplified NP-complete graph problems”, Theor. Comput. Sci. 1 (1976), 237–267.
20. Hertz, A., and de Werra, D.: “Using Tabu Search Techniques for Graph Coloring”, Computing 39 (1987), 345–351.
21. Johnson, D. S., Aragaon, C. R., McGeoch, L. A., and Schevon, C.: “Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning,” Operations Research 39 (1991), 378-406.
22. Knuth, D. E.: The Standford GraphBase, ACM Press, Addison Welsey, New York, (1993).
23. Krawczyk, H., and Kubale, M.: “An approximation algorithm for diagnostic test scheduling in multicomputer systems”, IEEE Trans. Comput. C-34 (1985), 869–872.
24. Kubale, M., and Jackowski, B.: “A generalized implicit enumeration algorithm for graph coloring”, Communications of the ACM 28 (1985), 412–418.
25. Leighton, F. T.: “A graph coloring algorithm for large scheduling problems”, Journal of Research of the National Bureau of Standards 84 (1979), 412–418.
26. Lund, C., and Yannakakis, M.: “On the Hardness of Approximating Minimization Problems”, Proc. 25th Annual ACM Symp. on Theory of Computing, (1993), 286–293 (Full version in J. ACM 41 5 (1994), 960-981.)
27. Mehrotra, A., and Trick, M. A.: “A Column Generation Approach for Graph Coloring”, INFORMS J. on Computing 8 (1996), 344–354.
28. Morgenstern, C.: “Distributed Coloration Neighborhood Search”, Volume 26 of Discrete Mathematics and Theoretical Computer Science AMS (1996), 335-358.
29. Mycielski, J.: “Sur le Coloriage des Graphes”, Colloquim Mathematiques 3 (1955) 161–162.
30. Osman, I. H., and Kelley, J. P.: Metaheuristics: Theory and Applications, Kluwer Academic Publishers, Hingam, MA (1996).
31. Sager, T. J., and Lin S.: “A Pruning Procedure for Exact Graph Coloring”, ORSA J. on Computing 3 (1993), 226–230.
32. Sewell, E. C.: “An Improved Algorithm for Exact Graph Coloring”, Second DIMACS Challenge (COLORING Papers), DIMACS Series in Computer Mathematics and Theoretical Computer Science (1993), 359-373.