Fast exact algorithm for L(2,1)-labeling of graphs

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

Volumn 6648 LNCS, Issue , 2011, Pages 82-93

  Junosza Szaniawski, Konstanty ^a   Kratochvíl, Jan ^b   Liedloff, Mathieu ^c   Rossmanith, Peter ^d   Rza̧zewski, Paweł ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b CHARLES UNIVERSITY   (Czech Republic)

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

^d RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENT VERTICES; CONNECTED GRAPH; EXACT ALGORITHMS; EXPONENTIAL TIME ALGORITHM; L(2 , 1)-LABELING; LABELINGS; NONNEGATIVE INTEGERS; VERTEX SET;

ALGORITHMS; EXPONENTIAL FUNCTIONS;

INTEGER PROGRAMMING;

EID: 79955763120     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20877-5_9     Document Type: Conference Paper

References (24)

1. Alon, N., Wormald, N.: igh degree graphs contain large-star factors. Fete of Combinatorics and Computer Science, Bolyai Soc. Math. Studies (20), 9-21 (2010)
2. Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximations for lambda-Colorings of Graphs. Computer Journal 47, 193-204 (2004)
3. Calamoneri, T.: The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography. Computer Journal 49, 585-608 (2006)
4. Chang, G.J., Kuo, D.: The L(2, 1)-labeling problem on graphs. SIAM Journal of Discrete Mathematics 9, 309-316 (1996)
5. Fiala, J., Golovach, P., 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., Kloks, T., Kratochvíl, J.: Fixed-parameter complexity of λ-labelings. Discrete Applied Mathematics 113, 59-72 (2001)
7. Fiala, J., Kratochvíl, J.: Locally constrained graph homomorphisms - structure, complexity, and applications. Computer Science Review 2, 97-111 (2008)
8. Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: Domination - A case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 191-203. Springer, Heidelberg (2005)
9. Fomin, F., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)
10. Griggs, J.R., Král, D.: Graph labellings with variable weights, a survey. Discrete Applied Mathematics 157, 2646-2658 (2009)
11. Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM Journal of Discrete Mathematics 5, 586-595 (1992)
12. Hale, W.K.: Frequency assignemnt: Theory and applications. Proc. IEEE 68, 1497-1514 (1980)
13. Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A Linear Time Algorithm for L(2,1)-Labeling of Trees. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 35-46. Springer, Heidelberg (2009)
14. Havet, F., Reed, B., Sereni, J.-S.: L(2,1)-labellings of graphs. In: Proceedings of SODA 2008, pp. 621-630 (2008)
15. Havet, F., Klazar, M., Kratochvíl, J., Kratsch, D., Liedloff, M.: Exact algorithms for L(2, 1)-labeling of graphs. Algorithmica 59, 169-194 (2011)
16. Janczewski, R., Kosowski, A., Małafiejski, M.: The complexity of the L(p, q)- labeling problem for bipartite planar graphs of small degree. Discrete Mathematics 309, 3270-3279 (2009)
17. Junosza-Szaniawski, K., Rza̧żewski, P.: On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 34-37. Springer, Heidelberg (2011)
18. Junosza-Szaniawski K., Rza̧żewski P.: On the Complexity of Exact Algorithm for L(2,1)-labeling of Graphs. KAM-DIMATIA Preprint Series 2010-992
19. Král, D.: Channel assignment problem with variable weights. SIAM Journal on Discrete Mathematics 20, 690-704 (2006)
20. Kratochvíl, J., Kratsch, D., Liedloff, M.: Exact algorithms for L(2,1)-labeling of graphs. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 513-524. Springer, Heidelberg (2007)
21. Roberts, F.S.: Private communication to J. Griggs
22. van Rooij, J.M.M., Bodlaender, H.L., Rossmanith, P.: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 566-577. Springer, Heidelberg (2009)
23. Strassen, V.: Gaussian Elimination is not Optimal. Numerische Mathematik 13, 354-356 (1969)
24. Yeh, R.: A survey on labeling graphs with a condition at distance two. Discrete Mathematics 306, 1217-1231 (2006)