CHECKCOL: Improved local search for graph coloring
Tài liệu tham khảo
Bianco, 1998, Solving a preemptive scheduling problem using coloring technique
Blazewicz, 1996
Cangalovic, 1991, Exact coloring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, EJOR, 51, 248, 10.1016/0377-2217(91)90254-S
Caramia, 1999, A fast and simple local search for graph coloring, vol. 1618, 319
Chams, 1987, Some experiments with simulated annealing for coloring graphs, EJOR, 32, 260, 10.1016/S0377-2217(87)80148-0
Coffman, 1983, An introduction to combinatorial models of dynamic storage allocation, SIAM Rev., 25, 311, 10.1137/1025074
Dailey, 1980, Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete, Discrete Math., 30, 289, 10.1016/0012-365X(80)90236-8
De Werra, 1985, An introduction to timetabling, European J. Oper. Res., 19, 151, 10.1016/0377-2217(85)90167-5
Eiben, 1998, Graph coloring with adaptive evolutionary algorithms, J. Heuristics, 4, 25, 10.1023/A:1009638304510
Fleurent, 1995, Genetic and hybrid algorithms for graph coloring, Ann. Oper. Res., 63, 437, 10.1007/BF02125407
Garey, 1976, Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1, 237, 10.1016/0304-3975(76)90059-1
Glover, 1997
Hertz, 1987, Using tabu search techniques for graph coloring, Computing, 39, 345, 10.1007/BF02239976
Johnson, 1991, Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning, Oper. Res., 39, 378, 10.1287/opre.39.3.378
Kannan, 1998, Register allocation in structured programs, J. Algorithms, 29, 223, 10.1006/jagm.1998.0956
Krawczyk, 1985, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Trans. Comput., C-34, 869, 10.1109/TC.1985.1676647
Leighton, 1979, A graph coloring algorithm for large scheduling problems, J. Res. Nat. Bur. Standards, 84, 412, 10.6028/jres.084.024
Lewandowski, 1996, Experiments with parallel graph coloring heuristics, vol. 26
Lund, 1993, On the hardness of approximating minimization problems, 286
Morgenstern, 1996, Distributed coloration neighborhood search, vol. 26, 335
Osman, 1996
Sewell, 1996, An improved algorithm for exact graph coloring, vol. 26, 359
Srivastava, 1994, ATOM: A system for building customized program analysis tools, 196