Greedy Algorithms for the Minimum Sum Coloring Problem
暂无分享,去创建一个
[1] Vahid Lotfi,et al. A graph coloring algorithm for large scale scheduling problems , 1986, Comput. Oper. Res..
[2] Ewa Kubicka,et al. An introduction to chromatic sums , 1989, CSC '89.
[3] Jin-Kao Hao,et al. Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..
[4] Alain Hertz,et al. Using tabu search techniques for graph coloring , 1987, Computing.
[5] Leo G. Kroon,et al. The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs , 1996, WG.
[6] Mohammad R. Salavatipour,et al. On Sum Coloring of Graphs , 2003, Discret. Appl. Math..
[7] Aziz Moukrim,et al. An exact method for graph coloring , 2006, Comput. Oper. Res..
[8] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.
[9] Zbigniew Kokosinski,et al. On Sum Coloring of Graphs with Parallel Genetic Algorithms , 2007, ICANNGA.