Graph labellings with variable weights, a survey

Discrete Applied Mathematics

Volumn 157, Issue 12, 2009, Pages 2646-2658

  Griggs, Jerrold R ^a   Král', Daniel ^b  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Distance constrained labeling; L (p, q) labeling; Real number graph labeling

Indexed keywords

CHANNEL ASSIGNMENT PROBLEM; DISTANCE CONSTRAINED LABELING; L (P, Q)-LABELING; REAL NUMBER; REAL NUMBER GRAPH LABELING; VARIABLE WEIGHT;

CELLULAR RADIO SYSTEMS; GRAPH THEORY; NUMBER THEORY; STRUCTURAL OPTIMIZATION; SURVEYS;

LABELING;

EID: 67249105324     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.08.024     Document Type: Article

References (52)

1. Aardal K.I., van Hoesel S.P.M., Koster A.M.C.A., Mannino C., and Sassano A. Models and solution techniques for frequency assignment problems. 4OR: A Quart. J. Oper. Res. 1 (2003) 261-317
2. G. Agnarsson, R. Greenlaw, M.M. Halldórsson, Powers of chordal graphs and their coloring, Congr. Numer. (in press)
3. Babilon R., Jelínek V., Král' D., and Valtr P. Labellings of graphs with fixed and variable edge-weights. SIAM J. Discrete Math. 21 (2007) 688-706
4. Bella P., Král' D., Mohar B., and Quittnerová K. Labelling planar graphs with a condition at distance two. European J. Combin. 28 (2007) 2201-2239
5. Bertossi A.A., and Bonucelli M.A. Code assignment for hidden terminal interference in multihop packet radio networks. IEEE/ACM Trans. Netw. 3 (1995) 441-449
6. Bertossi A.A., Pinotti C.M., and Tan R.B. Channel assignment with seperation for interference avoidance in wireless networks. IEEE Trans. Paralle Distrib. Syst. 14 (2003) 222-235
7. Bodlaender H.L., Kloks T., Tan R.B., and van Leeuwen J. Approximations for λ-coloring of graphs. Comput. J. 47 2 (2004) 193-204
8. Broadhurst R.E., Shanahan W.J., and Steffen M.D. We're sorry you're outside the coverage area. UMAP J. 21 (2000) 327-342
9. Calamoneri T. Exact solution of a class of frequency assignment problems in cellular networks and other regular grids. 8th Italian Conf. Theor. Comp. Sci. ICTCS'03. LNCS vol. 2841 (2003) 150-162
10. Calamoneri T. Optimal L (h, k)-labeling of regular grids. Discrete Math. Theor. Comput. Sci. 8 (2006) 141-158
11. Calamoneri T. The L (h, k)-labelling problem: A survey and annotated bibliography. Comput. J. 49 5 (2006) 585-608
12. Calamoneri T., Caminiti S., and Fertin G. New bounds for the L (h, k) number of regular grids. Int. J. Mobile Network Design Innovation 2 1 (2006) 92-101
13. Calamoneri T., Pelc A., and Petreschi R. Labelling trees with a condition at distance two. Discrete Math. 306 14 (2006) 1534-1539
14. Chang G.J., Ke W.-T., Liu D.D.-F., and Yeh R.K. On L (d, 1)-labellings of graphs. Discrete Math. 3 1 (2000) 57-66
15. Chang G.J., and Kuo D. The L (2, 1)-labelling problem on graphs. SIAM J. Discrete Math. 9 2 (1996) 309-316
16. Durand D.J., Kline J.M., and Woods K.M. Groovin' with the big band(width). UMAP J. 21 (2000) 357-368
17. R. Erman, S. Jurečič, D. Král', K. Stopar, N. Stopar, Optimal real number graph labelings of a subfamily of Kneser graphs (submitted for publication)
18. Fiala J., Kratochvíl J., and Kloks T. Fixed-parameter complexity of λ-labellings. Discrete Appl. Math. 113 1 (2001) 59-72
19. Fotakis D.A., Nikoletseas S.E., Papadopoulou V.G., and Spirakis P.G. NP-Completeness results and efficient approximations for radiocoloring in planar graphs. In: Rovan B. (Ed). Proc. MFCS'00. LNCS vol. 1893 (2000), Springer 363-372
20. Gallai T. On directed paths and circuits. In: Erdo{double acute}s P., and Katona G. (Eds). Theory of Graphs (1968), Academic Press, New York 115-118
21. Georges J.P., and Mauro D.W. Generalized vertex labelings with a condition at distance two. Congress. Numer. 109 (1995) 141-159
22. Georges J.P., and Mauro D.W. Labelling trees with a condition at distance two. Discrete Math. 269 (2003) 127-148
23. Gonçalves D. On the L (p, 1)-labelling of graphs. Discrete Math. Theor. Comput. Sci. AE (2005) 81-86
24. Goodwin J., Johnston D., and Marcus A. Radio channel assignemnts. UMAP J. 21 (2000) 369-378
25. Griggs J.R. Author/Judge's commentary: The outstanding channel assignment papers. UMAP J. 21 (2000) 379-386
26. Griggs J.R., and Jin X.T. Real number graph labellings with distance conditions. SIAM J. Discrete Math. 20 2 (2006) 302-327
27. J.R. Griggs, X.T. Jin, Real number graph labellings for paths and cycles, Internet Math. (in press)
28. J.R. Griggs, X.T. Jin, Real number channel assignments for lattices, SIAM J. Discrete Math. (in press)
29. Griggs J.R., and Jin X.T. Recent progress in mathematics and engineering on optimal graph labellings with distance conditions. J. Comb. Optim. 14 (2007) 249-257
30. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
31. Hale W.K. Frequency assignment: Theory and applications. Proc. IEEE 68 (1980) 1497-1514
32. van den Heuvel J., Leese R.A., and Shepherd M.A. Graph labelling and radio channel assignment. J. Graph Theory 29 (1998) 263-284
33. Jin X.T., and Yeh R.K. Graph distance-dependent labelling related to code assignment in computer networks. Naval Res. Logist. 52 (2005) 159-164
34. Kang J.-H. L (2, 1)-labeling of Hamiltonian graphs with maximum degree 3. SIAM J. Discrete Math. 22 (2008) 213-230
35. Král' D. An exact algorithm for channel assignment problem. Discrete Appl. Math. 145 2 (2004) 326-331
36. Král' D. Coloring powers of chordal graphs. SIAM J. Discrete Math. 18 3 (2004) 451-461
37. Král' D. The channel assignment problem with variable weights. SIAM J. Discrete Math. 20 3 (2006) 690-704
38. D. Král', A note on the Compactness principle for the channel assignment problem with variable weights (in preparation)
39. D. Král', P. Škoda, General bounds for the real number graph labelling and application to labellings of the triangular lattice, SIAM J. Discrete Math. (in press)
40. Král' D., and Škrekovski R. A theorem about channel assignment problem. SIAM J. Discrete Math. 16 3 (2003) 426-437
41. Leese R.A., and Noble S.D. Cyclic labellings with constraints at two distances. Electron. J. Combin. 11 (2004) R#16, 16 pp.
42. McDiarmid C. Discrete mathematics and radio channel assignment. In: Linhares-Salas C., and Reed B. (Eds). Recent Advances in Rheoretical and Applied Discrete Mathematics (2001), Springer 27-63
43. McDiarmid C. On the span in channel assignment problems: Bounds computing and counting. Discrete Math. 266 (2003) 387-397
44. Mintz J., Newcomer A., and Price J.C. Channel assignment model: The span without a face. UMAP J. 21 (2000) 311-326
45. Molloy M., and Salavatipour M.R. A bound on the chromatic number of the square of a planar graph. J. Combin. Theory Ser. B. 94 (2005) 189-213
46. Molloy M., and Salavatipour M.R. Frequency channel assignment on planar networks. In: Möhring R.H., and Raman R. (Eds). Proc. ESA'02. LNCS vol. 2461 (2002), Springer 736-747
47. Roberts F.S. T-colorings of graphs: Recent results and open problems. Discrete Math. 93 (1991) 229-245
48. F.S. Roberts, Working group agenda of DIMACS/DIMATIA/Renyi working group on graph colorings and their generalizations (2003), posted at http://dimacs.rutgers.edu/Workshops/GraphColor/main.html
49. Roy B. Nombre chromatique et plus longs chemins. Automat. Informat. 1 (1976) 127-132
50. Sakai D. Labelling chordal graphs: Distance two condition. SIAM J. Discrete Math. 7 (1994) 133-140
51. Whitaker R.M., Hurley S., and Allen S.M. Optimising channel assignments for private mobile radio networks in the UHF 2 band. Wirless Netw. 8 (2002) 587-595
52. D. Zhu, A. Shi, Optimal channel assignments, 2001, preprint