[CGG11] M. Chiarandini, G. Galbiati, S. Gualandi (2011). Efficiency issues in the RLF heuristic for graph coloring. In L. D. Gaspero, A. Schaerf, T. Stützle (eds.), Proceedings of the 9th Metaheuristics International Conference, MIC 2011, pp. 461-469. Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, Università di Udine, Udine, Italy. ISBN 978-88-90084-3-7. Source code available at http://www.imada.sdu.dk/~marco/gcp/rlf. [ bib | .pdf ]
[CS10] M. Chiarandini, T. Stützle (2010). An Analysis of Heuristics for Vertex Colouring. In P. Festa (ed.), Experimental Algorithms, Proceedings of the 9th International Symposium, (SEA 2010), vol. 6049 of Lecture Notes in Computer Science, pp. 326-337. Springer. Supplementary material and source code available at http://www.imada.sdu.dk/~marco/gcp-study/. [ bib | DOI ]
[Cha04] G. Chaitin (2004). Register allocation and spilling via graph coloring. SIGPLAN Not., vol. 39, no. 4, pp. 66-74. [ bib | DOI ]
[Klo02] W. Klotz (2002). Graph coloring algorithms. Tech. Rep. Mathematik-Bericht 5, Clausthal University of Technology, Clausthal, Germany. [ bib ]
[Pee01] H. A. Peelle (2001). Graph coloring in J: an introduction. In Proceedings of the 2001 International Conference on APL: An Arrays Odyssey, pp. 77-82. Yale University, New Haven, Connecticut, USA. [ bib | DOI ]
[Veg99] S. R. Vegdahl (1999). Using node merging to enhance graph coloring. In PLDI '99: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, pp. 150-154. ACM Press, New York, NY, USA. ISBN 1-58113-094-5. [ bib | DOI ]
[dW90] D. de Werra (1990). Heuristics for Graph Coloring. Computing Supplement, vol. 7, pp. 191-208. [ bib ]
[Lei79] F. T. Leighton (1979). A Graph Coloring Algorithm for Large Scheduling Problems. Journal of Research of the National Bureau of Standards, vol. 84, no. 6, pp. 489-506. [ bib ]
[Woo69] D. C. Wood (1969). A Technique for Coloring a Graph Applicable to Large-Scale Timetabling Problems. Computer Journal, vol. 12, pp. 317-322. [ bib ]