zbMATH — the first resource for mathematics

Distance-constrained grid colouring. (English) Zbl 1339.05107
Summary: Distance-constrained colouring is a mathematical model of the frequency assignment problem. This colouring can be treated as an optimization problem so we can use the toolbar of the optimization to solve concrete problems. In this paper, we show performance of distance-constrained grid colouring for two methods which are good in map colouring.
05C15 Coloring of graphs and hypergraphs
90C35 Programming involving graphs or networks
90C99 Mathematical programming
Full Text: DOI
[1] S. J. Russel, P. Norvig, Artificial intelligence: a modern approach Pearson 2002. ⇒6, 8
[2] P. Galinier, J. K. Hao, Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim., 3, 4 (1998) 379-397. ⇒5 · Zbl 0958.90071
[3] W. K. Hale, Frequency assignment: Theory and applications. Proceedings of the IEEE68, 12 (1980) 1497-1514. ⇒6
[4] P. Panigrahi, A survey on radio k-colorings of graphs AKCE Int. J. Graphs Comb.6, 1 (2009) 161. ⇒7 · Zbl 1210.05150
[5] T. Calamoneri, The L(h, k)-labelling problem: A survey and annotated bibliography. The Computer Journal49, 5 (2006) 585-608. ⇒7
[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, 10 · Zbl 0782.90054
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.