Author:
Kanahara Kazuho,Katayama Kengo,Miyake Takafumi,Tomita Etsuji
Publisher
Springer International Publishing
Reference8 articles.
1. Adegbindin, M., Hertz, A., Bellaïche, M.: A new efficient RLF-like algorithm for the vertex coloring problem. Yugoslav J. Oper. Res. 26(4), 441–456 (2016)
2. Balabhaskar, B., Sergiy, B.: Graph domination, coloring and cliques in telecommunications. In: Handbook of Optimization in Telecommunications, pp. 865–890. Springer (2006)
3. Brélaz, D.: New methods to color the vertices of a graph. Commun. ACM 22, 251–256 (1979)
4. Chaitin,G.J.: Register allocation and spilling via graph coloring. In: Proceedings of the 1982 SIGPLAN Symposium on Compiler Construction, SIGPLAN 1982, pp. 98–105 (1982)
5. Chiarandini, M., Galbiati, G., Gualandi, S.: Efficiency issues in the RLF heuristic for graph coloring. In: Proceedings of the 9th Metaheuristics International Conference, MIC 2011, pp. 461–469 (2011)