On the radiocoloring problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2571, Issue , 2002, Pages 118-127

  Calamoneri, Tiziana ^a   Petreschi, Rossella ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

ADJACENT VERTICES; FORMAL DEFINITION; FREQUENCY ASSIGNMENTS; RADIOCOLORING PROBLEMS; WIRELESS RADIO NETWORKS;

COLOR;

EID: 77954796354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36385-8_12     Document Type: Conference Paper

References (31)

1. K.I. Aardal, S.P.M. van Hoesel, A.M.C.A. Koster, C. Mannino and A. Sassano. Models and Solution Techniques for Frequency Assignment Problems. ZIB-Report 01-40, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, 2001.
2. A.A. Bertossi, C.M. Pinotti and R.B. Tan: Efficient Use of Radio Spectrum in Wireless Networks with Channel separation between Close Stations. Proc. 4th ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M), 2000.
3. H.L. Bodlaender, T. Kloks, R.B. Tan and J. Van Leeuwen. Approximations for λ- Coloring of Graphs. Tech Rep. UU-CS-2000-25, 2000. A preliminary version has been published in Proc. of STACS 2000.
4. A. Brandstadt, V.B. Le and J.P. Spinrad: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, 1999.
5. T. Calamoneri and R. Petreschi. λ-Coloring Unigraphs. Manuscript, submitted to Journal of Computer and System Sciences. 2001. A preliminary version has been published in Proc. of LATIN 02.
6. T. Calamoneri and R. Petreschi. λ-Coloring of Regular Tiling. Proc. First Cologne- Twente Workshop (CTW). Electronic Notes in Discrete Mathematics, 8, 2001. http://www.elsevier.nl/locate/endmCTW2001.
7. T. Calamoneri and R. Petreschi. L(2, 1)-Labeling of Planar Graphs (Extended Abstract). Proc. 5th ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M), 2001, pp. 28–33.
8. D. Castelino, S. Hurley and N.M. Stephens. A tabu search algorithm for frequency assignment. Annals of Operations Research 63: 301–319, 1996.
9. G.J. Chang and D. Kuo. The radiocoloring Problem on Graphs. SIAM J. Disc. Math., 9: 309–316, 1996.
10. M. Duque-Anton, D. Kunz and B. Ruber. Channel assignment for cellular radio using simulated annealing. IEEE Trans. on Vehicular Technology 42: 14–21, 1993.
11. W. Crompton, S. Hurley and N.M. Stephen. A parallel genetic algorithm for frequency assignment problems. Proc. IMACS/IEEE International Symp. on Signal Processing, Robotics and Neural Networks, pp. 81–84, 1994.
12. J. Fiala, T. Kloks and J. Kratochvil. Fixed-parameter Complexity of λ-Labelings. Proc. Graph-Theoretic Concepts of Compu. Sci. (WG99), pp. 350–363. Lectures Notes in Computer Science 1665, 1999.
13. D.A. Fotakis, S.E. Nikoletseas, V.G. Papadoulou and P.G. Spirakis. NPcompleteness Results and Efficient Approximations for Radiocoloring in Planar Graphs. Proc. 25th Int.l Symp. on Math. Foundations of Compu. Sci. (MFCS 2000), 2000.
14. P. C. Fishburn and F. S. Roberts. Full Color Theorems for L(2, 1)-Colorings. DIMACS Tech. Rep. 2000-08, 2000.
15. N. Funabiki and Y. Takefuji. A neural network parallel algorithm for channel assignment problem in cellular radio networks. IEEE Trans. on Vehicular Technology 41: pp. 430–437, 1992.
16. J.P. Georges, D.W. Mauro and M.A. Whittlesey. Relating path coverings to vertex labelings with a condition at distance two. Discr. Math. 135: 103–111, 1994.
17. J. P. Georges, D. W. Mauro and M. I. Stein. Labeling Products of Complete Graphs with a Condition at Distance Two. SIAM J. Discrete Math.: 28–35, 2000.
18. J.R. Griggs and R.K. Yeh. Labeling graphs with a Condition at Distance 2. SIAM J. Disc. Math 5:586–595,. Graph Labeling and Radio Channel Assignment. Journal of Graph Theory 29: 263–283, 1998.
19. J. van den Heuvel and S. McGuinnes. Colouring the square of a planar graphs. Report LSE-CDAM-99-06, Centre for Discrete and Applicable Mathematics, London School of Economics, London, U.K., 1999.
20. K. Jonas. Graph Coloring Analogues With a Condition at Distance Two: L(2, 1)- Labelings and List λ-Labelings. Ph.D. thesis, University of South Carolina, Columbia, 1993.
21. A.M.C.A. Koster. Frequency Assignment. Ph.D. thesis, Universiteit Maastricht, 1999.
22. D. Kunz. Channel assignment for cellular radio using neural networks. IEEE Trans. on Vehicular Technology 40: 188–193, 1991.
23. W.K. Lai and G.G. Coghill. Channel assignment through evolutionary optimization. IEEE Trans. on Vehicular Technology 45: 91–96, 1996.
24. N.V.R. Mahadev and U.N. Peled. Threshold Graphs and Related Topics. Ann. Discrete Math. 56, 1995.
25. M. Molloy and M.R. Salavatipour. Frequency channel assignment on planar networks. Proc. of 10th Annual European Symposium on Algorithms (ESA 2002), pp. 736–747, Lectures Notes in Computer Science 2461, 2002.
26. R.A. Murphey, P.M. Pardalos and M.G.C. Resende. Frequency Assignment Problems. In Handbook of Combinatorial Optimization, D.-Z. Du and P.M. Pardalos (Eds.):295–377, 1999. Kluwer Academic Publishers.
27. F.S. Roberts. T-Colorings of graphs: recent results and open problems. Discrete Mathematics 93: 229–245, 1991.
28. D. Sakai. Labeling Chordal Graphs: Distance Two Condition. SIAM J. Disc. Math 7:133–140, 1994.
29. M. Shepherd. Radio Channel Assignment. Ph.D. thesis, Merton College, Oxford, 1998.
30. M.A. Whittelesey, J.P. Georges and D.W. Mauro. On the λ-Number of Qn and Related Graphs. SIAM Journal Disc. Math. 8(4): 499–506, 1995.
31. R. Y. Yeh. Labeling Graphs with a Condition at Distance Two. Ph.D. Thesis, Dept. of Mathematics, University of South Carolina, Columbia, SC, 1990.