Approximate L(δ1, δ2,..., δt)-coloring of trees and interval graphs

Networks

Volumn 49, Issue 3, 2007, Pages 204-216

  Bertossi, Alan A ^a   Pinotti, Cristina M ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

Author keywords

Approximation algorithms; Channel assignment; Interval graphs; L( 1, 2,..., t) coloring; Trees; Wireless networks

Indexed keywords

APPROXIMATION ALGORITHMS; COLORING; GRAPH THEORY; WIRELESS NETWORKS;

CHANNEL ASSIGNMENT; INTERVAL GRAPHS;

TREES (MATHEMATICS);

EID: 34247532964     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20154     Document Type: Article

References (26)

1. G. Agnarsson, R. Greenlaw, and M.M. Halldorson, On powers of chordal graphs and their colorings, Congressus Numer 144 (2000), 41-65.
2. R. Battiti, A.A. Bertossi, and M.A. Bonuccelli, Assigning codes in wireless networks: Bounds and scaling properties, Wireless Networks 5 (1999), 195-209.
3. A.A. Bertossi and M.C. Pinotti, Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees, J Parallel Distrib Comput 62 (2002), 1314-1333.
4. A.A. Bertossi, M.C. Pinotti, and R. Rizzi, Channel assignment on strongly-simplicial graphs, Proc. 3rd Int'l Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN), IEEE IPDPS, Nice, 2003 (published on CD-ROM).
5. A.A. Bertossi, M.C. Pinotti, R. Rizzi, and A.M. Shende, Channel assignment for interference avoidance in honey-comb wireless networks, J Parallel Distrib Comput 64 (2004), 1329-1344.
6. A.A. Bertossi, M.C. Pinotti, and R.B. Tan, Channel assignment with separation for interference avoidance in wireless networks, IEEE Trans Parallel Distrib Syst 14 (2003), 222-235.
7. H.L. Bodlaender, T. Kloks, R.B. Tan, and J. van Leeuwen, Approximations for λ-coloring of graphs, Comput J 47 (2004), 193-204.
8. K.S. Booth and G.S. Lueker, Linear algorithms to recognize interval graphs and test for the consecutive ones property, Proc. Seventh Annual ACM Symposium on Theory of Computing, Albuquerque, NM, 1975, pp. 255-265.
9. A. Brandstadt, V.B. Le, and J.P. Spinrad, Graph classes: A survey, SIAM, Philadelphia, PA, 1999.
10. T. Calamoneri, The L(h, k)-labelling problem: A survey and annotated bibliography, Comput J (2006), to appear.
11. T. Calamoneri, A. Pelc, and R. Petreschi, Labeling trees with a condition at distance two, Discrete Math 306 (2006), 1534-1539.
12. G.J. Chang, W.-T. Ke, D. Kuo, D.D.-F. Liu, and R.K. Yeh, On L(d, 1)-labelings on graphs, Discrete Math 220 (2000), 57-66.
13. G.J. Chang and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J Discrete Math 9 (1996), 309-316.
14. I. Chlamtac and S.S. Pinter, Distributed nodes organization algorithm for channel access in a multihop dynamic radio network, IEEE Trans Comput 36 (1987), 728-737.
15. D.G. Corneil, S. Olariu, and L. Stewart, The ultimate interval graph recognition algorithm?, Proc. of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1998, pp. 175-180.
16. J.P. Georges and D.W. Mauro, Generalized vertex labelings with a condition at distance two, Congressus Numer 109 (1995), 141-159.
17. J.P. Georges and D.W. Mauro, Labeling trees with a condition at distance two, Discrete Math 269 (2003), 127-148.
18. M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
19. J.R. Griggs and R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J Discrete Math 5 (1992), 586-595.
20. W.K. Hale, Frequency assignment: Theory and application, Proceedings of the IEEE 68 (1980), 1497-1514.
21. S.T. McCormick, Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem, Math Program 26 (1983), 153-171.
22. D. Sakai, Labeling chordal graphs: Distance two condition, SIAM J Discrete Math 7 (1994), 133-140.
23. A. Sen, T. Roxborough, and S. Medidi, Upper and lower bounds of a class of channel assignment problems in cellular networks, Proc. of IEEE INFOCOM'98, San Francisco, CA, 1998, Vol. 3, pp. 1284-1291.
24. A.M. Shende, et al., A characterisation of optimal channel assignments for wireless networks modelled as cellular and square grids, Proc. 3rd Int'l Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN) IEEE IPDPS, Nice, 2003 (published on CD-ROM).
25. J. Van den Heuvel, R.A Leese, and M.A. Shepherd, Graph labelling and radio channel assignment, J Graph Theory 29 (1998), 263-283.
26. X. Zhou, Y. Kanari, and T. Nishizeki, Generalized vertex coloring of partial k-trees, IEICE Trans. Fundam Electron Commun Comput Sci E83-A (2000), 671-678.