An O (n1.75) algorithm for L (2, 1)-labeling of trees

Theoretical Computer Science

Volumn 410, Issue 38-40, 2009, Pages 3702-3710

  Hasunuma, Toru ^a   Ishii, Toshimasa ^b   Ono, Hirotaka ^c   Uno, Yushi ^d  

^a UNIVERSITY OF TOKUSHIMA   (Japan)

^b OTARU UNIVERSITY OF COMMERCE   (Japan)

^c KYUSHU UNIVERSITY   (Japan)

^d Osaka Prefecture University   (Japan)

Author keywords

Frequency channel assignment; Graph algorithm; L (2, 1) labeling; Vertex coloring

Indexed keywords

FREQUENCY/CHANNEL ASSIGNMENT; GRAPH ALGORITHM; GRAPH G; L (2, 1)-LABELING; LABELINGS; LINEAR-TIME ALGORITHMS; MAXIMUM DEGREE; NONNEGATIVE INTEGERS; NP-HARD; TIME ALGORITHMS; TREE-WIDTH; VERTEX COLORING; VERTEX SET;

ALGORITHMS; COLORING; COMPUTATIONAL COMPLEXITY; LABELS; SET THEORY;

GRAPH THEORY;

ALGORITHMS; COMPUTATION; LABELING; PROBLEM SOLVING;

EID: 68249127938     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.04.025     Document Type: Article

References (14)

1. Bodlaender H.L., Kloks T., Tan R.B., and van Leeuwen J. Approximations for λ-coloring of graphs. Comput. J. 47 (2004) 193-204
2. Calamoneri T. The L (h, k)-labelling problem: A survey and annotated bibliography. Comput. J. 49 5 (2006) 585-608
3. Chang G.J., Ke W.-T., Kuo D., Liu D.D.-F., and Yeh R.K. On L (d, 1)-labeling of graphs. Discrete Math. 220 (2000) 57-66
4. Chang G.J., and Kuo D. The L (2, 1)-labeling problem on graphs. SIAM J. Disc. Math. 9 (1996) 309-316
5. J. Fiala, P.A. Golovach, J. Kratochvíl, Distance constrained labelings of graphs of bounded treewidth, in: Proc. 32th International Colloquium on Automata, Languages and Programming, ICALP, 2005, pp. 360-372
6. Fiala J., Kloks T., and Kratochvíl J. Fixed-parameter complexity of λ-labelings. Discrete Appl. Math. 113 (2001) 59-72
7. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance 2. SIAM J. Disc. Math. 5 (1992) 586-595
8. Hale W.K. Frequency assignment: Theory and applications. Proc. IEEE 68 (1980) 1497-1514
9. Havet F., and Yu M.-L. (p, 1)-Total labelling of graphs. Discrete Math. 308 (2008) 496-513
10. 5 / 2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2 4 (1973) 225-231
11. Roberts F.S. T-colorings of graphs: Recent results and open problems. Discrete Math. 93 (1991) 229-245
12. Wang W.-F. The L (2, 1)-labelling of trees. Discrete Appl. Math. 154 (2006) 598-603
13. n and related graphs. SIAM J. Disc. Math. 8 (1995) 499-506
14. Yeh R.K. A survey on labeling graphs with a condition at distance two. Discrete Math. 306 (2006) 1217-1231