Exact algorithms for L(2,1)-labeling of graphs

Algorithmica (New York)

Volumn 59, Issue 2, 2011, Pages 169-194

  Havet, Frédéric ^a   Klazar, Martin ^b   Kratochvíl, Jan ^b   Kratsch, Dieter ^c   Liedloff, Mathieu ^d  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b CHARLES UNIVERSITY   (Czech Republic)

^c UNIVERSITÉ DE LORRAINE   (France)

^d UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Algorithm; Graph; L(2,1) labeling; Moderately exponential time algorithm

Indexed keywords

ADJACENT VERTICES; EXACT ALGORITHMS; EXPONENTIAL TIME ALGORITHM; FREQUENCY ASSIGNMENT PROBLEM; GRAPH; GRAPH G; GRAPH LABELINGS; L(2,1)-LABELING; NOTION OF DISTANCE; NP COMPLETE; NP COMPLETE PROBLEMS; RUNNING TIME; VERTEX SET;

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; FREQUENCY ALLOCATION;

ALGORITHMS;

EID: 79951557982     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-009-9302-7     Document Type: Article

References (24)

1. Alon, N.; Wormald, N.: High degree graphs contain large-star factors (submitted)
2. Björklund, A.; Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science 2006, pp. 575-582 (2006) (Pubitemid 351175545)
3. H.L. Bodlaender T. Kloks R.B. Tan J. van Leeuwen 2004 Approximations for lambda-colorings of graphs Comput. J. 47 193 204 1039.68090 10.1093/comjnl/47.2. 193
4. G.J. Chang D. Kuo 1996 The L(2,1)-labeling problem on graphs SIAM J. Discrete Math. 9 309 316 0860.05064 10.1137/S0895480193245339 1386886
5. Fiala, J.; Kratochvíl, J.: Complexity of partial covers of graphs. In: Proceedings of ISAAC 2001. LNCS, vol. 2223, pp. 537-549. Springer, Berlin (2001)
6. J. Fiala J. Kratochvíl 2002 Partial covers of graphs Discuss. Math. Graph Theory 22 89 99 1017.05094 1936227
7. J. Fiala T. Kloks J. Kratochvíl 2001 Fixed-parameter complexity of λ-labelings Discrete Appl. Math. 113 59 72 0982.05085 10.1016/S0166-218X(00)00387-5 1855514
8. Fiala, J.; Golovach, P.; Kratochvíl, J.: Distance constrained labelings of graphs of bounded treewidth. In: Proceedings of ICALP 2005. LNCS, vol. 3580, pp. 360-372. Springer, Berlin (2005) (Pubitemid 41436115)
9. J. Fiala J. Kratochvíl A. Pór 2005 On the computational complexity of partial covers of theta graphs Electron. Notes Discrete Math. 19 79 85 10.1016/j.endm.2005.05.012
10. Fomin, F.; Grandoni, F.; Kratsch, D.: Measure and conquer: Domination-a case study. In: Proceedings of ICALP 2005. LNCS, vol. 3380, pp. 192-203. Springer, Berlin (2005)
11. F. Fomin P. Heggernes D. Kratsch 2007 Exact algorithms for graph homomorphisms Theory Comput. Syst. 41 381 393 1119.68133 10.1007/s00224-007- 2007-x 2329330
12. Gonçalves, D.: On the L(p,1)-labelling of graphs. In: Discrete Mathematics and Theoretical Computer Science Proceedings, vol. AE, pp. 81-86
13. J.R. Griggs R.K. Yeh 1992 Labelling graphs with a condition at distance 2 SIAM J. Discrete Math. 5 586 595 0346.05112 10.1137/0405048 1186826
14. Hasunuma, T.; Ishii, T.; Ono, H.; Uno, Y.: A linear time algorithm for L(2,1)-labeling of trees. arXiv:0810.0906v1 (2008)
15. Havet, F.; Reed, B.; Sereni, J.-S.: L(2,1)-labellings of graphs. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms 2008, pp. 621-630 (2008)
16. P. Hell J. Nešetřil 1990 On the complexity of H-colouring J. Comb. Theory Ser. B 48 92 110 0639.05023 10.1016/0095-8956(90)90132-J
17. D.S. Johnson M. Yannakakis C.H. Papadimitriou 1988 On generating all maximal independent sets Inf. Process. Lett. 27 119 123 0654.68086 10.1016/0020-0190(88)90065-8 933271 (Pubitemid 18590751)
18. n ) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science 2006, pp. 583-590 (2006) (Pubitemid 351175546)
19. D. Král' 2006 Channel assignment problem with variable weights SIAM J. Discrete Math. 20 690 704 0767.05080 10.1137/040619636 2272225 (Pubitemid 47250579)
20. Kratochvíl, J.; Kratsch, D.; Liedloff, M.: Exact algorithms for L(2,1)-labeling of graphs. In: Proceedings of MFCS 2007. LNCS, vol. 4708, pp. 513-524. Springer, Berlin (2007)
21. Leese, R.A.; Noble, S.D.: Cyclic labellings with constraints at two distances. Electron. J. Comb. 11 (2004) (Research paper 16)
22. D. Liu X. Zhu 2003 Circular distance two labelings and circular chromatic numbers Ars Comb. 69 177 183 1072.05570 2007650 (Pubitemid 37347254)
23. D. Liu X. Zhu 2005 Multilevel distance labelings for paths and cycles SIAM J. Discrete Math. 19 610 621 1095.05033 10.1137/S0895480102417768 2191283 (Pubitemid 44231243)
24. Roberts, F.S. Private communication to J. Griggs