Generating and Radiocoloring Families of Perfect Graphs
In this work we experimentally study the min order Radiocoloring problem (RCP) on Chordal, Split and Permutation graphs, which are three basic families of perfect graphs. This problem asks to find an assignment using the minimum number of colors to the vertices of a given graph G, so that each pair of vertices which are at distance at most two apart in G have different colors. RCP is an NP-Complete problem on chordal and split graphs . For each of the three families, there are upper bounds or/and approximation algorithms known for minimum number of colors needed to radiocolor such a graph [4,10].
We design and implement radiocoloring heuristics for graphs of above families, which are based on the greedy heuristic. Also, for each one of the above families, we investigate whether there exists graph instances requiring a number of colors in order to be radiocolored, close to the best known upper bound for the family. Towards this goal, we present a number generators that produce graphs of the above families that require either (i) a large number of colors (compared to the best upper bound), in order to be radiocolored, called “extremal” graphs or (ii) a small number of colors, called “non-extremal”instances. The experimental evaluation showed that random generated graph instances are in the most of the cases “non-extremal” graphs. Also, that greedy like heuristics performs very well in the most of the cases, especially for “non-extremal” graphs.
KeywordsPolynomial Time Maximum Degree Greedy Heuristic Chordal Graph Const Color
Unable to display preview. Download preview PDF.
- 1.Agnarsson, G., Greenlaw, R., Halldorsson, M.H.: Powers of chordal graphs and their coloring, Congressus Numerantium (since September 2000)Google Scholar
- 2.Andreou, M.I., Papadopoulou, V.G., Spirakis, P.G., Theodorides, B., Xeros, A.: Generating and Radiocoloring Families of Perfect Graphs, CRESCCO Technical Report (2004)Google Scholar
- 4.Bodlaendera, H.L., Kloksb, T., Tana,c, R.B., Leeuwena, J.V.: Approximations for λ-Coloring of Graphs. a Utrecht University, The Netherlands, b Vrije Universiteit, The Netherlands, c University of Sciences & Arts of Oklahoma, OK 73018, U.S.AGoogle Scholar
- 5.Fotakis, D.A., Nikoletseas, S.E., Papadopoulou, V.G., Spirakis, P.G.: NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. Journal of Theoretical Computer Science (to appear)Google Scholar
- 6.Fotakis, D., Spirakis, P.: Assignment of Reusable and Non-Reusable Frequencies. In: International Conference on Combinatorial and Global Optimization (1998)Google Scholar
- 8.Hale, W.K.: Frequency Assignment: Theory and Applications. Proceedings of the IEEE 68(12) (December 1980)Google Scholar
- 9.Mehlhorn, K., Naher, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)Google Scholar