A Linear Time Algorithm for L(2,1)-Labeling of Trees

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

Volumn 5757 LNCS, Issue , 2009, Pages 35-46

  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

[No Author keywords available]

Indexed keywords

BEST-KNOWN ALGORITHMS; GRAPH G; LINEAR TIME; LINEAR-TIME ALGORITHMS; MAXIMUM DEGREE; NONNEGATIVE INTEGERS; NP-HARD; RUNNING TIME; TIME ALGORITHMS; TREE-WIDTH; VERTEX SET;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LABELING; SET THEORY;

GRAPH THEORY;

ALGORITHMS; COMPUTATION; LABELING; SET;

EID: 70350378256     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_4     Document Type: Conference Paper

References (17)

1. Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximations for λ-coloring of graphs. The Computer Journal 47, 193-204 (2004)
2. Calamoneri, T.: The L(h,k)-labelling problem: A survey and annotated bibliography. The Computer Journal 49, 585-608 (2006), http://www.dsi.uniroma1. it/̃calamo/ PDF-FILES/survey.pdf (January 13, 2009)
3. Chang, G.J., Ke, W.-T., Kuo, D., Liu, D.D.-F., Yeh, R.K.: On L(d, 1)-labeling of graphs. Discr. Math. 220, 57-66 (2000)
4. Chang, G.J., Kuo, D.: The L(2,1)-labeling problem on graphs. SIAM J. Discr. Math. 9, 309- 316 (1996)
5. Fiala, J., Golovach, P.A., Kratochvíl, J.: Distance constrained labelings of graphs of bounded treewidth. In: Caires, L., Italiano, G.F.,Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 360-372. Springer, Heidelberg (2005)
6. Fiala, J., Golovach, P.A., Kratochvíl, J.: Distance constrained labelings of trees. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 125-135. Springer, Heidelberg (2008)
7. Fiala, J., Golovach, P.A., Kratochvíl, J.: Computational complexity of the distance constrained labeling problem for trees (Extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldorsson, M.M., Ingolfsdottir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 294-305. Springer, Heidelberg (2008)
8. Fiala, J., Kloks, T., Kratochvíl, J.: Fixed-parameter complexity of λ-labelings. Discr. Appl. Math. 113, 59-72 (2001)
9. Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45, 783-797 (1998)
10. Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Disc. Math. 5, 586-595 (1992)
11. Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: An O(n1.75) algorithm for L(2, 1)-labeling of trees. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 185-197. Springer, Heidelberg (2008); Journal version to appear in Theoretical Comp. Sci., doi:10.1016/j.tcs.2009.04.025
12. Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A linear time algorithm for L(2,1)-labeling of trees. CoRR abs/0810.0906 (2008)
13. Havet, F., Reed, B., Sereni, J.-S.: L(2,1)-labelling of graphs. In: Proc. 19th SIAM-SODA, pp. 621-630 (2008)
14. Hopcroft, J.E., Karp, R.M.: An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225-231 (1973)
15. Kratochvíl, J., Kratsch, D., Liedloff, M.: Exact algorithms for L(2, 1)-labeling of graphs. In: Ku?cera, L., Ku?cera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 513-524. Springer, Heidelberg (2007)
16. Wang, W.-F.: The L(2,1)-labelling of trees. Discr. Appl. Math. 154, 598-603 (2006)
17. Yeh, R.K.: A survey on labeling graphs with a condition at distance two. Discr. Math. 306, 1217-1231 (2006)