Computational complexity of the distance constrained labeling problem for trees (extended abstract)

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 294-305

  Fiala, Jiří ^a   Golovach, Petr A ^b   Kratochvíl, Jan ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; LABELS; LINGUISTICS; MATHEMATICAL TECHNIQUES; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; TRANSLATION (LANGUAGES); TREES (MATHEMATICS);

ADJACENT VERTICES; FREQUENCY ASSIGNMENT PROBLEM; GRAPH-THEORETICAL APPROACH; L-LABELING; LABEL SPACE; NON-NEGATIVE INTEGERS; NP-HARD; POLYNOMIAL-TIME; SUFFICIENT AND NECESSARY CONDITION; VERTEX-TRANSITIVE; WIRELESS NETWORKS;

LABELING;

COMPUTATION; GEOMETRY; GRAPHIC METHODS; LABELING; LABELS; MATHEMATICAL ANALYSIS; PROBLEM SOLVING; TRANSLATION; TREES;

EID: 49049099021     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_25     Document Type: Conference Paper

References (19)

1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308-340 (1991)
2. Calamoneri, T.: The L(h, k)-labeling problem: A survey and annotated bibliography. Computer Journal 49(5), 585-608 (2006)
3. Chang, G.J., Ke, W.-T., Liu, D.D.-F., Yeh, R.K.: On L(d, 1)-labelings of graphs. Discrete Mathematics 220(1-3), 57-66 (2000)
4. Chang, G.J., Kuo, D.: The L(2, 1)-labeling problem on graphs. SIAM Journal on Discrete Mathematics 9(2), 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., and Kratochvíl, J.: Distance constrained labelings of trees. Tech. Rep. ITI Series 2008-369, Charles University (2007)
7. Fiala, J., Kratochvíl, J.: Partial covers of graphs. Discussiones Mathematicae Graph Theory 22, 89-99 (2002)
8. Fiala, J., Kratochvíl, J., Kloks, T.: Fixed-parameter complexity of λ-labelings. Discrete Applied Mathematics 113(1), 59-72 (2001)
9. Fiala, J., Kratochvíl, J., Proskurowski, A.: Distance constrained labeling of precolored trees. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 285-292. Springer, Heidelberg (2001)
10. Fiala, J., Kratochvíl, J., Proskurowski, A.: Systems of distant representatives. Discrete Applied Mathematics 145(2), 306-316 (2005)
11. Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM Journal on Discrete Mathematics 5(4), 586-595 (1992)
12. Harary, F.: Graph theory. Addison-Wesley Series in Mathematics IX. Addison-Wesley, Reading (1969)
13. Havet, F., Reed, B., Sereni, J.-S.: L(2,1)-labelling of graphs. In: Huang, S.-T. (ed.) Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 621-630. SIAM, Philadelphia (2008)
14. Král, D.: Mixed hypergraphs and other coloring problems. Discrete Mathematics 307(7-8), 923-938 (2007)
15. Leese, R.A., Noble, S.D.: Cyclic labellings with constraints at two distances. Electronic Journal of Combinatorics 11(1) (2004)
16. Liu, D.D.-F., Zhu, X.: Circulant distant two labeling and circular chromatic number. Ars Combinatoria 69, 177-183 (2003)
17. Matoušek, J., Nešetřil, J.: Invitation to Discrete Mathematics. Oxford University Press, Oxford (1998)
18. Roberts, F.S.: T-colorings of graphs: recent results and open problems. Discrete Mathematics 93(2-3), 229-245 (1991)
19. Yeh, R.K.: A survey on labeling graphs with a condition at distance two. Discrete Mathematics 306(12), 1217-1231 (2006)