Frequency channel assignment on planar networks

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

Volumn 2461, Issue , 2002, Pages 736-747

  Molloy, Michael ^a   Salavatipour, Mohammad R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ADJACENT NODES; APPROXIMATION RATIOS; FREQUENCY CHANNEL ASSIGNMENT; L(P , Q)-LABELING; PLANAR NETWORKS; TIME ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84938079930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_64     Document Type: Conference Paper

References (17)

1. G. Agnarsson and M. M. Halldorsson, Coloring powers of planar graphs, To appear in SIAM J. Disc. Math., Earlier version appeared in Proc. of the 11th annual ACM-SIAM Symp. on Disc. Alg., pages 654-662, 2000. 737, 738, 746
2. H. L. Bodlaender, T. Kloks, R. B. Tan, and J. Van Leeuwen, Approximations for A-Coloring of Graphs, In Proc. of 17th Annual Symp. on Theo. Aspc. of Comp. Sci. pages 395-406, Springer 2000. 737
3. O. Borodin, H. J. Broersma, A. Glebov, and J. Van Den Heuvel, Colouring at distance two in planar graphs, In preparation 2001. 737, 746
4. J. Chang and Kuo, The L(2,1)-labeling problem on graphs, SIAM J. Disc. Math. 9:309-316, 1996. 737
5. D. A. Fotakis, S. E. Nikoletseas, V. G. Papadopoulou, and P. G. Spirakis, Hardness results and efficient approximations for frequency assignment problems: radio labeling and radio coloring, J. of Computers and Artificial intelligence, 20(2):121-180, 2001. 737, 738
6. J. P. Georges and D. W. Mauro, On the size of graphs labeled with a condition at distance two, J. Graph Theory, 22:47-57, 1996. 737
7. J. P. Georges and D. W. Mauro, Some results on Aj-numbers of the products of complete graphs, Congr. Numer., 140:141-160, 1999. 737
8. J. R. Griggs and R. K. Yeh, Labeling graphs with a condition at distance 2, Siam J. Disc. Math., 5:586-595, 1992. 737
9. T. K. Jonas, Graph coloring analogues with a condition at distance two: L(2,1)-labelings and list A-labelings, Ph.D. Thesis, University of South Carolina, 1993. 737
10. S. Ramanathan and E. L. Lloyd, On the complexity of distance-2 coloring, In Proc. 4th Int. Conf. Comput. and Inform. pages 71-74, 1992. 737
11. S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multi-hop radio networks, IEEE/ACM Trans. on Networking, 1(2):166-172, 1993. 737
12. D. P. Sanders and Y. Zhao, A new bound on the cyclic chromatic number, J. of Comb. Theory Series B 83:102-111, 2001. 737
13. J. Van Den Heuvel and S Mcguinness, Colouring the Square of a Planar Graph, Preprint. 737, 738, 739, 745
14. J. Van Den Heuvel, R. A. Leese, and M. A. Shepherd, Graph labeling and radio channel assignment, J. Graph Theory, 29:263-283, 1998. 737
15. G. Wegner, Graphs with given diameter and a coloring problem, Technical report, University of Dortmond, 1977. 737
16. A. Whittlesey, J. P. Georges, and D. W. Mauro, On the A-number of Qn and related graphs, SIAM J. Disc. Math., 8:499-506, 1995. 737
17. S. A. Wong, Colouring Graphs with Respect to Distance, M.Sc. Thesis, Department of Combinatorics and Optimization, University of Waterloo, 1996. 737