Advertisement

On Improved Exact Algorithms for L(2,1)-Labeling of Graphs

  • Konstanty Junosza-Szaniawski
  • Paweł Rzążewski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6460)

Abstract

L(2,1)-labeling is graph labeling model where adjacent vertices get labels that differ by at least 2 and vertices in distance 2 get different labels. In this paper we present an algorithm for finding an optimal L(2,1)-labeling (i.e. an L(2,1)-labeling in which largest label is the least possible) of a graph with time complexity O * ( 3.5616 n ), which improves a previous best result: O * ( 3.8739 n ).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fiala, J., Kratochvíl, J., Kloks, T.: Fixed-parameter complexity of λ-labelings. Discrete Applied Mathematics 113(1), 59–72 (2001)CrossRefzbMATHGoogle Scholar
  2. 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-7Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Konstanty Junosza-Szaniawski
    • 1
  • Paweł Rzążewski
    • 1
  1. 1.Faculty of Mathematics and Information ScienceWarsaw University of TechnologyWarsawPoland

Personalised recommendations