Fast Exact Algorithm for L(2,1)-Labeling of Graphs

被引：0
|
作者：
Junosza-Szaniawski, Konstanty [1 ]
Kratochvil, Jan [2 ,3 ]
Liedloff, Mathieu [4 ]
Rossmanith, Peter [5 ]
Rzazewski, Pawel [1 ]
机构：
[1] Warsaw Univ Technol, Fac Math & Informat Sci, Pl Politech 1, PL-00661 Warsaw, Poland
[2] Charles Univ Prague, Dept Appl Math, CR-11800 Prague 1, Czech Republic
[3] Charles Univ Prague, Inst Theoret Comp Sci, CR-11800 Prague 1, Czech Republic
[4] Univ Orleans, Lab Informat Fondamentale Orleans, F-45067 Orleans 2, France
[5] Rhein Westfal TH Aachen, Dept Comp Sci, Aachen, Germany
来源：
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011 | 2011年 / 6648卷
关键词：
VARIABLE WEIGHTS; LABELINGS; ASSIGNMENT;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
An L(2, 1)-labeling of a graph is a mapping from its vertex set into nonnegative integers such that the labels assigned to adjacent vertices differ by at least 2, and labels assigned to vertices of distance 2 are different. The span of such a labeling is the maximum label used, and the L(2, 1)-span of a graph is the minimum possible span of its L(2, 1)-labelings. We show how to compute the L(2, 1)-span of a connected graph in time O*(2.6488(n)). Previously published exact exponential time algorithms were gradually improving the base of the exponential function from 4 to the so far best known 3.2361, with 3 seemingly having been the Holy Grail.
引用
收藏
页码：82 / 93
页数：12
相关论文
共 50 条
  • [1] Fast exact algorithm for L(2,1)-labeling of graphs
    Junosza-Szaniawski, Konstanty
    Kratochvil, Jan
    Liedloff, Mathieu
    Rossmanith, Peter
    Rzazewski, Pawel
    [J]. THEORETICAL COMPUTER SCIENCE, 2013, 505 : 42 - 54
  • [2] On the complexity of exact algorithm for L(2,1)-labeling of graphs
    Junosza-Szaniawski, Konstanty
    Rzazewski, Pawel
    [J]. INFORMATION PROCESSING LETTERS, 2011, 111 (14) : 697 - 701
  • [3] Exact Algorithms for L(2,1)-Labeling of Graphs
    Frédéric Havet
    Martin Klazar
    Jan Kratochvíl
    Dieter Kratsch
    Mathieu Liedloff
    [J]. Algorithmica, 2011, 59 : 169 - 194
  • [4] Exact Algorithms for L(2,1)-Labeling of Graphs
    Havet, Frederic
    Klazar, Martin
    Kratochvil, Jan
    Kratsch, Dieter
    Liedloff, Mathieu
    [J]. ALGORITHMICA, 2011, 59 (02) : 169 - 194
  • [5] Exact algorithms for L(2,1)-labeling of graphs
    Kratochvil, Jan
    Kratsch, Dieter
    Liedloff, Mathieu
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 2007, 4708 : 513 - +
  • [6] On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
    Junosza-Szaniawski, Konstanty
    Rzazewski, Pawel
    [J]. COMBINATORIAL ALGORITHMS, 2011, 6460 : 34 - 37
  • [7] L(2,1)-labeling of Block Graphs
    Panda, B. S.
    Goel, Preeti
    [J]. ARS COMBINATORIA, 2015, 119 : 71 - 95
  • [8] L(2,1)-LABELING OF CIRCULANT GRAPHS
    Mitra, Sarbari
    Bhoumik, Soumya
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2019, 39 (01) : 143 - 155
  • [9] The L(2,1)-labeling problem on graphs
    Chang, GJ
    Kuo, D
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1996, 9 (02) : 309 - 316
  • [10] The L(2,1)-labeling problem on graphs
    Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30050, Taiwan
    [J]. SIAM J Discrete Math, 2 (309-316):
12345