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 条
  • [41] The L (2,1)-labeling on the skew and converse skew products of graphs
    Shao, Zhendong
    Yeh, Roger K.
    Zhang, David
    [J]. APPLIED MATHEMATICS LETTERS, 2007, 20 (01) : 59 - 64
  • [42] A Linear Time Algorithm for L(2,1)-Labeling of Trees
    Hasunuma, Toru
    Ishii, Toshimasa
    Ono, Hirotaka
    Uno, Yushi
    [J]. ALGORITHMICA, 2013, 66 (03) : 654 - 681
  • [43] A Linear Time Algorithm for L(2,1)-Labeling of Trees
    Hasunuma, Toru
    Ishii, Toshimasa
    Ono, Hirotaka
    Uno, Yushi
    [J]. ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 35 - +
  • [44] A Linear Time Algorithm for L(2,1)-Labeling of Trees
    Toru Hasunuma
    Toshimasa Ishii
    Hirotaka Ono
    Yushi Uno
    [J]. Algorithmica, 2013, 66 : 654 - 681
  • [45] Surjective L(2,1)-labeling of cycles and circular-arc graphs
    Amanathulla, Sk
    Pal, Madhumangal
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2018, 35 (01) : 739 - 748
  • [46] ONLINE COLORING AND L(2,1)-LABELING OF UNIT DISK INTERSECTION GRAPHS
    Junosza-Szaniawski, Konstanty
    Rzazewski, Pawel
    Sokol, Joanna
    Wesek, Krzysztof
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (02) : 1335 - 1350
  • [47] An O(n<1.75) algorithm for L(2,1)-labeling of trees
    Hasunuma, Toru
    Ishii, Toshimasa
    Ono, Hirotaka
    Uno, Yushi
    [J]. ALGORITHM THEORY - SWAT 2008, 2008, 5124 : 185 - +
  • [48] The L(2,1)-labeling of unigraphs
    Calamoneri, Tiziana
    Petreschi, Rossella
    [J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (12) : 1196 - 1206
  • [49] L(2,1)-labeling of unigraphs
    Department of Computer Science, Sapienza University of Rome, Italy
    [J]. Lect. Notes Comput. Sci., (57-68):
  • [50] L(2,1)-Labeling of the Iterated Mycielski Graphs of Graphs and Some Problems Related to Matching Problems
    Dliou, Kamal
    El Boujaoui, Hicham
    Kchikech, Mustapha
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024, 44 (02) : 489 - 518
12345