The channel assignment problem with variable weights

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 3, 2006, Pages 690-704

  Král, Daniel ^a,b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Channel assignment problem; Graph labeling with distance conditions

Indexed keywords

BOUNDARY CONDITIONS; FINITE ELEMENT METHOD; FUNCTION EVALUATION; LINEAR SYSTEMS; PROBLEM SOLVING;

CHANNEL ASSIGNMENT PROBLEMS; DISTANCE CONDITIONS; GRAPH LABELING;

GRAPH THEORY;

EID: 34547919617     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/040619636     Document Type: Article

References (22)

1. G. AGNARSSON, R. GREENLAW, AND M. M. HALLDÓRSSON, Powers of chordal graphs and their coloring, Congr. Numer., to appear.
2. R. BABILON, V. JELÍNEK, D. KRÁL', AND P. VALTR, Labelings of graphs with fixed and variable edge-weights, submitted.
3. P. BELLA, D. KRÁL', B. MOHAR, AND K. QUITTNEROVÁ, Labeling planar graphs with a condition at distance two, European J. Combin., to appear.
4. H. L. BODLAENDER, T. KLOKS, R. B. TAN, AND J. VAN LEEUWEN, λ-coloring of graphs, in STACS 2000 (Lille), Lecture Notes in Comput. Sci. 1770, G. Goos, J. Hartmanis, and J. van Leeuwen, eds., Springer, Berlin, 2000, pp. 395-406.
5. G. J. CHANG, W.-T. KE, D. D.-F. LIU, AND R. K. YEH, On L(d, 1)-labellings of graphs, Discrete Math., 3 (2000), pp. 57-66.
6. G. J. CHANG AND D. KUO, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309-316.
7. J. FIALA, J. KRATOCHVÍL, AND T. KLOKS, Fixed-parameter complexity of λ-labelings, Discrete Appl. Math., 113 (2001), pp. 59-72.
8. D. A. FOTAKIS, S. E. NIKOLETSEAS, V. G. PAPADOPOULOU, AND P. G. SPIRAKIS, NP-completeness results and efficient approximations for radiocoloring in planar graphs, in Mathematical Foundations of Computer Science 2000 (Bratislava), Lecture Notes in Comput. Sci. 1893, B. Rovan, ed., Springer, Berlin, 2000, pp. 363-372.
9. J. R. GRIGGS AND X. T. JIN, Real number graph labellings with distance conditions, SIAM J. Discrete Math., 20 (2006), pp. 302-327.
10. J. R. GRIGGS AND X. T. JIN, Real number graph labellings of paths and cycles, submitted.
11. J. R. GRIGGS AND X. T. JIN, Real number graph labellings of infinite graphs, submitted.
12. J. R. GRIGGS AND R. K. YEH, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
13. D. GONÇALVES, On the L(p, 1)-labelling of graphs, Discrete Math. Theor. Comput. Sci., AE (2005), pp. 81-86.
14. W. K. HALE, Frequency assignment: Theory and applications, Proc. IEEE, 68 (1980), pp. 1497-1514.
15. J.-H. KANG, L(2, 1)-labeling of 3-regular Hamiltonian graphs, submitted.
16. J.-H. KANG, L(2, 1)-Labelling of 3-Regular Hamiltonian Graphs, Ph.D. thesis, University of Illinois, Urbana-Champaign, IL, 2004.
17. D. KRÁL', An exact algorithm for the channel assignment problem, Discrete Appl. Math. 145 (2005), pp. 326-331.
18. D. KRÁL', Coloring powers of chordal graphs, SIAM J. Discrete Math., 18 (2004), pp. 451-461.
19. D. KRÁL' AND R. ŠKREKOVSKI, A theorem about the channel assignment problem, SIAM J. Discrete Math., 16 (2003), pp. 426-437.
20. C. MCDIARMID, Discrete mathematics and radio channel assignment, in Recent Advances in Algorithms and Combinatorics, C. Linhares-Sales and B. Reed, eds., Springer, New York, 2003, pp. 27-63.
21. C MCDIARMID, On the span in channel assignment problems: Bounds, computing and counting, Discrete Math., 266 (2003), pp. 387-397.
22. D. SAKAI, Labeling chordal graphs: Distance two condition, SIAM J. Discrete Math., 7 (1994), pp. 133-140.