Distance-constrained grid colouring

References

[1] S. J. Russel, P. Norvig, Artificial intelligence: a modern approach Pearson 2002. ⇒6, 8
Search in Google Scholar
[2] P. Galinier, J. K. Hao, Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim., 3, 4 (1998) 379–397. ⇒510.1023/A:1009823419804
Search in Google Scholar
[3] W. K. Hale, Frequency assignment: Theory and applications. Proceedings of the IEEE68, 12 (1980) 1497–1514. ⇒610.1109/PROC.1980.11899
Search in Google Scholar
[4] P. Panigrahi, A survey on radio k-colorings of graphs AKCE Int. J. Graphs Comb.6, 1 (2009) 161. ⇒7
Search in Google Scholar
[5] T. Calamoneri, The L(h, k)-labelling problem: A survey and annotated bibliography. The Computer Journal49, 5 (2006) 585–608. ⇒710.1093/comjnl/bxl018
Search in Google Scholar
[6] S. Minton, et al. Minimizing conicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence58.1 1992, 161–205. ⇒6, 9, 1010.1016/0004-3702(92)90007-K
Search in Google Scholar