On the recursive largest first algorithm for graph colouring

References

• Gupta , D. K. and Gupta , N. 2004 . A new approach to partial constraint satisfaction problems . International Journal of Computer Mathematics , 81 : 1465 – 1476 .
   Web of Science ®Google Scholar
• Leighton , F. T. 1979 . A graph coloring algorithm for large scheduling problems . Journal of Research of the National Bureau of Standards , 84 : 489 – 505 .
   PubMedGoogle Scholar
• Chaitin , G. J. Register allocation and spilling via graph coloring . Proceedings of the ACM SIGPLAN 82 Symposium on Compiler Construction , pp. 98 – 105 . New York, NY
   Google Scholar
• Gebremedhin , A. H. , Manne , F. and Pothen , A. 2005 . What color is your Jacobian? Graph coloring for computing derivatives . SIAM Review , 47 : 629 – 705 .
   Web of Science ®Google Scholar
• Feige , U. and Kilian , J. Zero knowledge and the chromatic number . Proceedings of the 11th Annual IEEE Conference on Computational Complexity , pp. 278 – 287 . Washington, DC
   Google Scholar
• Mehrotra , A. and Trick , M. A. 1996 . A column generation approach for graph coloring . INFORMS Journal on Computing , 8 : 344 – 354 .
   Google Scholar
• Hertz , A. and de Werra , D. 1987 . Using tabu search techniques for graph coloring . Computing , 39 : 345 – 351 .
   Web of Science ®Google Scholar
• Galinier , P. and Hertz , A. 2006 . A survey of local search methods for graph coloring . Computers & Operations Research , 33 : 2547 – 2562 .
   Web of Science ®Google Scholar
• Hovland , P. D. , Norris , B. , Strout , M. M. , Bhowmick , S. and Utke , J. 2005 . Sensitivity analysis and design optimization through automatic differentiation . Journal of Physics: Conference Series , 16 : 466 – 470 .
   Google Scholar
• Culberson , J. C. and Luo , F. 1996 . “ Exploring the k-colorable landscape with iterated greedy ” . In DIMACS Series in Discrete Mathematics and Theoretical Computer Science , Edited by: Johnson , D. S. and Trick , M. A. Vol. 26. , 245 – 284 . Providence, RI : American Mathematical Society .
   Google Scholar
• Brélaz , D. 1979 . New methods to color the vertices of a graph . Communications of the ACM , 22 : 251 – 256 .
   Web of Science ®Google Scholar
• Johnson , D. S. , Aragon , C. R. , McGeoch , L. A. and Schevon , C. 1991 . Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning . Operations Research , 39 : 378 – 406 .
   Web of Science ®Google Scholar
• Laguna , M. and Martí , R. 2001 . A GRASP for coloring sparse graphs . Computational Optimization and Applications , 19 : 165 – 178 .
   Web of Science ®Google Scholar
• Locatelli , M. , Bomze , I. M. and Pelillo , M. 2007 . “ Swaps, diversification, and the combinatorics of pivoting for the maximum weight clique ” . Venezia, , Italy Technical Report CS-2002-12, Università Ca’ Foscari di Venezia Available online at: http://www.dsi.unive.it/∼pelillo/papers/comb-pivot.pdf (accessed April
   Google Scholar
• Palubeckis , G. 2003 . Steepest ascent: a generalization of the greedy algorithm for the maximum clique problem . Information Technology and Control , 28 : 7 – 13 .
   Google Scholar
• Campêlo , M. , Corrêa , R. and Frota , Y. Cliques, holes and lower bounds for the vertex coloring problem . Paper presented at the 18th International Symposium on Mathematical Programming . August . pp. 18 – 22 . Copenhagen
   Google Scholar
• Campêlo , M. , Corrêa , R. and Frota , Y. 2004 . Cliques, holes and the vertex coloring polytope . Information Processing Letters , 89 : 159 – 164 .
   Web of Science ®Google Scholar