Graph radio coloring concepts
DOI:
https://doi.org/10.2298/YJOR0302207KKeywords:
graph, radio coloring, algorithm, channel assignmentAbstract
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. .References
Aardal, K., Hurkens, A., Lenstra, J.K., Tourine, S.R. (1996) Algorithms for frequency assignment problems. CWI Quarterly, 9, 1-9
Cameron,, Wu, Y. (1979) A frequency assignment algorithm based on a minimum residual difficulty heuristic. u: Proc. IEEE Int. Symp. EMC 79 (CH13839 EMC), 350-354
Christofides, N. (1975) Graph theory, an algorithmic approach. New York-San Diego, itd: Academic Press
Garey, M.R., Johnson, D.S. (1978) Computers and intractability: A guide to the theory of NP-completeness. San Francisco, CA, itd: W.H. Freeman Publishing
Hale, W.K. (1980) Frequency assignment: Theory and applications. u: Proceedings of the IEEE, 69, 12
Harary, F. Private communication
Harary, F. (1969) Graph theory. Reading, MA, itd: Addison-Wesley
Michaels, J.G., Rosen, K.H. (1991) Applications of discrete mathematics. New York, itd: McGraw-Hill
Murphey, R.A., Pardalos, P.M., Resende, M.G.C. (1999) Frequency assignment problems. u: Handbook of Combinatorial Optimization, Dordrecht, itd: Kluwer Academic
Savvidou, E. (2001) Algorithm for graph coloring, radio coloring and predefined coloring separation. Thessaloniki: University of Macedonia, Dpt of Appl. Informatic
Downloads
Published
Issue
Section
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.