Graph Radiocoloring Concepts
Yugoslav journal of operations research, Tome 13 (2003) no. 2, p. 207
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
The evolution of the telecommunication technology, such as mobile
telecommunication equipment, radio, television, teleconferencing, etc necessitated the
existence of numerously broadcast channels. However the corresponding frequencies
may interfere for reason of distance, geographical or atmospherical structure or for a
variety of other factors.
In the present paper we give the definition of the graph radio coloring concept which is
a graph coloring generalization. We also introduce radio coloring invariants which are
of a great practical importance to problems regarding the allocation of diverse
frequencies in order to avoid interference occurrences between channel transmissions.
A heuristic algorithm that finds approximate values of the radio chromatic number and
radio chromatic cost of a given graph is developed and the result of a computational
experiment of the proposed algorithm is given.
@article{YJOR_2003_13_2_a6,
author = {R. Kalfakakou and G. Nikolakopoulou and E. Savvidou and M. Tsouros},
title = {Graph {Radiocoloring} {Concepts}},
journal = {Yugoslav journal of operations research},
pages = {207 },
year = {2003},
volume = {13},
number = {2},
zbl = {1049.05035},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2003_13_2_a6/}
}
R. Kalfakakou; G. Nikolakopoulou; E. Savvidou; M. Tsouros. Graph Radiocoloring Concepts. Yugoslav journal of operations research, Tome 13 (2003) no. 2, p. 207 . http://geodesic.mathdoc.fr/item/YJOR_2003_13_2_a6/