On improved exact algorithms 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 6460 LNCS, Issue , 2011, Pages 34-37

  Junosza Szaniawski, Konstanty ^a   Rza̧zewski, Paweł ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENT VERTICES; EXACT ALGORITHMS; GRAPH LABELINGS; TIME COMPLEXITY;

ALGORITHMS;

COMBINATORIAL MATHEMATICS;

EID: 79953221135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19222-7_4     Document Type: Conference Paper

References (2)

1. Fiala, J., Kratochvíl, J., Kloks, T.: Fixed-parameter complexity of λ-labelings. Discrete Applied Mathematics 113(1), 59-72 (2001)
2. Havet, F., Klazar, M., Kratochvíl, J., Kratsch, D., Liedloff, M.: Exact Algorithms for L(2, 1)-Labeling of Graphs. Algorithmica, doi: 10.1007/s00453-009-9302-7