Fast exact algorithm for L(2,1)-labeling of graphs

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...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 505; pp. 42 - 54
Main Authors: Junosza-Szaniawski, Konstanty, Kratochvíl, Jan, Liedloff, Mathieu, Rossmanith, Peter, Rzążewski, Paweł
Format: Journal Article
Language:English
Published: Elsevier B.V 23.09.2013
Elsevier
Subjects:
[formula omitted]-labeling
Computer Science
Data Structures and Algorithms
Exponential-time algorithm
Graphs
Exponential-time algorithm
Graphs
L(2,1)-labeling
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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.6488n). Previously published exact exponential time algorithms were gradually improving the base of the exponential function from 4 to the so far best known 3, with 3 itself seemingly having been the Holy Grail for quite a while. As concerns special graph classes, we are able to solve the problem in time O∗(2.5944n) for claw-free graphs, and in time O∗(2n−r(2+nr)r) for graphs having a dominating set of size r.
AbstractList 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.6488n). Previously published exact exponential time algorithms were gradually improving the base of the exponential function from 4 to the so far best known 3, with 3 itself seemingly having been the Holy Grail for quite a while. As concerns special graph classes, we are able to solve the problem in time O∗(2.5944n) for claw-free graphs, and in time O∗(2n−r(2+nr)r) for graphs having a dominating set of size r.
Author Junosza-Szaniawski, Konstanty
Rossmanith, Peter
Liedloff, Mathieu
Kratochvíl, Jan
Rzążewski, Paweł
Author_xml – sequence: 1
  givenname: Konstanty
  surname: Junosza-Szaniawski
  fullname: Junosza-Szaniawski, Konstanty
  email: k.szaniawski@mini.pw.edu.pl
  organization: Warsaw University of Technology, Faculty of Mathematics and Information Science, Pl. Politechniki 1, 00-661 Warszawa, Poland
– sequence: 2
  givenname: Jan
  surname: Kratochvíl
  fullname: Kratochvíl, Jan
  email: honza@kam.mff.cuni.cz
  organization: Department of Applied Mathematics, and Institute for Theoretical Computer Science, Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic
– sequence: 3
  givenname: Mathieu
  surname: Liedloff
  fullname: Liedloff, Mathieu
  email: mathieu.liedloff@univ-orleans.fr
  organization: Laboratoire d’Informatique Fondamentale d’Orléans, Université d’Orléans, 45067 Orléans Cedex 2, France
– sequence: 4
  givenname: Peter
  surname: Rossmanith
  fullname: Rossmanith, Peter
  email: rossmani@cs.rwth-aachen.de
  organization: Department of Computer Science, RWTH Aachen University, Germany
– sequence: 5
  givenname: Paweł
  surname: Rzążewski
  fullname: Rzążewski, Paweł
  email: p.rzazewski@mini.pw.edu.pl
  organization: Warsaw University of Technology, Faculty of Mathematics and Information Science, Pl. Politechniki 1, 00-661 Warszawa, Poland
BackLink https://hal.science/hal-00942917$$DView record in HAL
BookMark eNp9kMtKAzEUhoNUsK0-gLtZWnDGJHNJg6tSrBUG3Og6nMmlTZlOShKKvr0zjG5cNJsD4f_O5ZuhSec6jdA9wRnBpHo6ZFGGjGJCM1xlOGdXaEqWjKeU8mKCpjjHRZpzVt6gWQgH3L-SVVNENxBior9AxgTanfM27o-JcT6pH-gjWaQtNLq13S5xJtl5OO3DLbo20AZ991vn6HPz8rHepvX769t6Vacyz0lMWUEVKCkVcEIMLppyWRpjqgYAVKG5zisiJVZKY97AEAAF_VYS1JIw4PkcLca-e2jFydsj-G_hwIrtqhbDH8a8oJywM-mzbMxK70Lw2ghpI0TruujBtoJgMWgSB9FrEoMmgSvRa-pJ8o_8G3WJeR4Z3Z9_ttqLIK3upFbWaxmFcvYC_QMKIoFp
CitedBy_id crossref_primary_10_1007_s00453_015_0004_z
crossref_primary_10_1145_3051094
crossref_primary_10_1016_j_ipl_2014_02_012
crossref_primary_10_15803_ijnc_14_1_26
Cites_doi 10.1093/comjnl/bxl018
10.1109/PROC.1980.11899
10.1145/1552285.1552286
10.1016/S0166-218X(00)00387-5
10.1007/s00453-009-9302-7
10.1016/j.disc.2005.11.029
10.1016/j.disc.2008.09.028
10.1007/BF02165411
10.1007/978-3-642-13580-4_1
10.1016/j.dam.2008.08.024
10.1137/S0895480193245339
10.1016/j.ipl.2011.05.008
10.1016/j.cosrev.2008.06.001
10.1137/040619636
10.1016/j.dam.2010.06.016
10.1137/0405048
10.1016/j.ipl.2011.04.010
10.1093/comjnl/47.2.193
ContentType Journal Article
Copyright 2012 Elsevier B.V.
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: 2012 Elsevier B.V.
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID 6I.
AAFTH
AAYXX
CITATION
1XC
DOI 10.1016/j.tcs.2012.06.037
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Hyper Article en Ligne (HAL)
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1879-2294
EndPage 54
ExternalDocumentID oai:HAL:hal-00942917v1
10_1016_j_tcs_2012_06_037
S0304397512006548
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
4.4
457
4G.
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
AAYFN
ABAOU
ABBOA
ABJNI
ABMAC
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ACZNC
ADBBV
ADEZE
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
AXJTR
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HVGLF
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
RIG
ROL
RPZ
SCC
SDF
SDG
SES
SPC
SPCBC
SSV
SSW
SSZ
T5K
TN5
WH7
YNT
ZMT
~G-
29Q
9DU
AAEDT
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABEFU
ABFNM
ABWVN
ACLOT
ACNNM
ACRPL
ACVFH
ADCNI
ADMUD
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGHFR
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
FGOYB
G-2
HZ~
R2-
SEW
TAE
WUQ
ZY4
~HD
1XC
XJT
ID FETCH-LOGICAL-c331t-742dadccda911f04b585fff6baaad4e9e361cc0dde09baf04bada005cad817a93
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000325905200006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0304-3975
IngestDate Tue Oct 14 20:44:47 EDT 2025
Sat Nov 29 05:15:10 EST 2025
Tue Nov 18 21:51:59 EST 2025
Fri Feb 23 02:30:23 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Exponential-time algorithm
Graphs
L(2,1)-labeling
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c331t-742dadccda911f04b585fff6baaad4e9e361cc0dde09baf04bada005cad817a93
ORCID 0000-0003-2518-606X
OpenAccessLink https://dx.doi.org/10.1016/j.tcs.2012.06.037
PageCount 13
ParticipantIDs hal_primary_oai_HAL_hal_00942917v1
crossref_citationtrail_10_1016_j_tcs_2012_06_037
crossref_primary_10_1016_j_tcs_2012_06_037
elsevier_sciencedirect_doi_10_1016_j_tcs_2012_06_037
PublicationCentury 2000
PublicationDate 2013-09-23
PublicationDateYYYYMMDD 2013-09-23
PublicationDate_xml – month: 09
  year: 2013
  text: 2013-09-23
  day: 23
PublicationDecade 2010
PublicationTitle Theoretical computer science
PublicationYear 2013
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Griggs, Král (br000070) 2009; 157
Král (br000120) 2006; 20
Junosza-Szaniawski, Kratochvíl, Liedloff, Rossmanith, Rzążewski (br000105) 2011; vol. 6648
N. Alon, N. Wormald, High degree graphs contain large-star factors, In: Fete of Combinatorics and Computer Bolyai Society Mathematical Studies 20 (2010) 9–21.
Kratochvíl, Kratsch, Liedloff (br000125) 2007; vol. 4708
Brandstädt, Le, Spinrad (br000015) 1999
Fomin, Grandoni, Kratsch (br000060) 2009; 56
Junosza-Szaniawski, Rzążewski (br000110) 2011; vol. 6460
Fomin, Grandoni, Kratsch (br000055) 2005; vol. 3380
Fomin, Kratsch (br000065) 2010
Fiala, Golovach, Kratochvíl (br000040) 2005; vol. 3580
Cygan, Kowalik (br000030) 2011; 111
F.S. Roberts, Private communication to J. Griggs.
Calamoneri (br000020) 2006; 49
W.K. Hale, Frequency assignment: theory and applications, in: Proc. IEEE, vol. 68, 1980, pp. 1497–1514.
Janczewski, Kosowski, Małafiejski (br000100) 2009; 309
Hasunuma, Ishii, Ono, Uno (br000085) 2009; vol. 5757
Bodlaender, Kloks, Tan, van Leeuwen (br000010) 2004; 47
Junosza-Szaniawski, Rzążewski (br000115) 2011; 111
Strassen (br000140) 1969; 13
labellings of graphs, in: Proceedings of SODA 2008, 2008, pp. 621–630.
Havet, Klazar, Kratochvíl, Kratsch, Liedloff (br000095) 2011; 59
Chang, Kuo (br000025) 1996; 9
Eggeman, Havet, Noble (br000035) 2010; 158
Fiala, Kratochvíl (br000050) 2008; 2
F. Havet, B. Reed, J.-S. Sereni
van Rooij, Bodlaender, Rossmanith (br000135) 2009; vol. 5757
Yeh (br000145) 2006; 306
Fiala, Kloks, Kratochvíl (br000045) 2001; 113
Griggs, Yeh (br000075) 1992; 5
Griggs (10.1016/j.tcs.2012.06.037_br000070) 2009; 157
10.1016/j.tcs.2012.06.037_br000130
Junosza-Szaniawski (10.1016/j.tcs.2012.06.037_br000105) 2011; vol. 6648
10.1016/j.tcs.2012.06.037_br000090
Kratochvíl (10.1016/j.tcs.2012.06.037_br000125) 2007; vol. 4708
Griggs (10.1016/j.tcs.2012.06.037_br000075) 1992; 5
Fomin (10.1016/j.tcs.2012.06.037_br000060) 2009; 56
Junosza-Szaniawski (10.1016/j.tcs.2012.06.037_br000110) 2011; vol. 6460
Král (10.1016/j.tcs.2012.06.037_br000120) 2006; 20
Calamoneri (10.1016/j.tcs.2012.06.037_br000020) 2006; 49
Bodlaender (10.1016/j.tcs.2012.06.037_br000010) 2004; 47
10.1016/j.tcs.2012.06.037_br000005
Cygan (10.1016/j.tcs.2012.06.037_br000030) 2011; 111
Fiala (10.1016/j.tcs.2012.06.037_br000040) 2005; vol. 3580
Hasunuma (10.1016/j.tcs.2012.06.037_br000085) 2009; vol. 5757
Janczewski (10.1016/j.tcs.2012.06.037_br000100) 2009; 309
Brandstädt (10.1016/j.tcs.2012.06.037_br000015) 1999
Yeh (10.1016/j.tcs.2012.06.037_br000145) 2006; 306
Fiala (10.1016/j.tcs.2012.06.037_br000045) 2001; 113
Havet (10.1016/j.tcs.2012.06.037_br000095) 2011; 59
Chang (10.1016/j.tcs.2012.06.037_br000025) 1996; 9
10.1016/j.tcs.2012.06.037_br000080
Fomin (10.1016/j.tcs.2012.06.037_br000055) 2005; vol. 3380
Strassen (10.1016/j.tcs.2012.06.037_br000140) 1969; 13
Fomin (10.1016/j.tcs.2012.06.037_br000065) 2010
van Rooij (10.1016/j.tcs.2012.06.037_br000135) 2009; vol. 5757
Junosza-Szaniawski (10.1016/j.tcs.2012.06.037_br000115) 2011; 111
Eggeman (10.1016/j.tcs.2012.06.037_br000035) 2010; 158
Fiala (10.1016/j.tcs.2012.06.037_br000050) 2008; 2
References_xml – volume: vol. 3580
  start-page: 360
  year: 2005
  end-page: 372
  ident: br000040
  article-title: Distance constrained labelings of graphs of bounded treewidth
  publication-title: Proceedings of ICALP 2005
– volume: 59
  start-page: 169
  year: 2011
  end-page: 194
  ident: br000095
  article-title: Exact algorithms for
  publication-title: Algorithmica
– volume: 113
  start-page: 59
  year: 2001
  end-page: 72
  ident: br000045
  article-title: Fixed-parameter complexity of
  publication-title: Discrete Applied Mathematics
– volume: 13
  start-page: 354
  year: 1969
  end-page: 356
  ident: br000140
  article-title: Gaussian elimination is not optimal
  publication-title: Numerische Mathematik
– volume: vol. 6460
  start-page: 34
  year: 2011
  end-page: 37
  ident: br000110
  article-title: On improved exact algorithms for
  publication-title: Proceedings of IWOCA 2010
– year: 2010
  ident: br000065
  article-title: Exact Exponential Algorithms
– volume: 158
  start-page: 1777
  year: 2010
  end-page: 1788
  ident: br000035
  article-title: -
  publication-title: Discrete Applied Mathematics
– volume: 20
  start-page: 690
  year: 2006
  end-page: 704
  ident: br000120
  article-title: Channel assignment problem with variable weights
  publication-title: SIAM Journal on Discrete Mathematics
– reference: F.S. Roberts, Private communication to J. Griggs.
– volume: 9
  start-page: 309
  year: 1996
  end-page: 316
  ident: br000025
  article-title: The
  publication-title: SIAM Journal of Discrete Mathematics
– volume: vol. 4708
  start-page: 513
  year: 2007
  end-page: 524
  ident: br000125
  article-title: Exact algorithms for
  publication-title: Proceedings of MFCS 2007
– volume: 111
  start-page: 727
  year: 2011
  end-page: 730
  ident: br000030
  article-title: Channel assignment via fast zeta transform
  publication-title: Information Processing Letters
– volume: vol. 5757
  start-page: 35
  year: 2009
  end-page: 46
  ident: br000085
  article-title: A linear time algorithm for
  publication-title: Proceedings of ESA 2009
– volume: vol. 6648
  start-page: 82
  year: 2011
  end-page: 93
  ident: br000105
  article-title: Fast exact algorithm for
  publication-title: Proceedings of TAMC 2011
– volume: 49
  start-page: 585
  year: 2006
  end-page: 608
  ident: br000020
  article-title: The
  publication-title: Computer Journal
– reference: N. Alon, N. Wormald, High degree graphs contain large-star factors, In: Fete of Combinatorics and Computer Bolyai Society Mathematical Studies 20 (2010) 9–21.
– volume: 56
  start-page: 25:1
  year: 2009
  end-page: 25:32
  ident: br000060
  article-title: A measure and conquer approach for the analysis of exact algorithms
  publication-title: Journal of the ACM
– reference: W.K. Hale, Frequency assignment: theory and applications, in: Proc. IEEE, vol. 68, 1980, pp. 1497–1514.
– reference: F. Havet, B. Reed, J.-S. Sereni,
– volume: vol. 5757
  start-page: 566
  year: 2009
  end-page: 577
  ident: br000135
  article-title: Dynamic programming on tree decompositions using generalised fast subset convolution
  publication-title: Proceedings of ESA 2009
– year: 1999
  ident: br000015
  article-title: Graph classes: a survey
  publication-title: SIAM Monographs on Discrete Mathematics and Applications
– volume: 47
  start-page: 193
  year: 2004
  end-page: 204
  ident: br000010
  article-title: Approximations for lambda-colorings of graphs
  publication-title: Computer Journal
– reference: -labellings of graphs, in: Proceedings of SODA 2008, 2008, pp. 621–630.
– volume: 111
  start-page: 697
  year: 2011
  end-page: 701
  ident: br000115
  article-title: On the complexity of exact algorithm for
  publication-title: Information Processing Letters
– volume: 2
  start-page: 97
  year: 2008
  end-page: 111
  ident: br000050
  article-title: Locally constrained graph homomorphisms—structure, complexity, and applications
  publication-title: Computer Science Review
– volume: 309
  start-page: 3270
  year: 2009
  end-page: 3279
  ident: br000100
  article-title: The complexity of the
  publication-title: Discrete Mathematics
– volume: 157
  start-page: 2646
  year: 2009
  end-page: 2658
  ident: br000070
  article-title: Graph labellings with variable weights, a survey
  publication-title: Discrete Applied Mathematics
– volume: 306
  start-page: 1217
  year: 2006
  end-page: 1231
  ident: br000145
  article-title: A survey on labeling graphs with a condition at distance two
  publication-title: Discrete Mathematics
– volume: vol. 3380
  start-page: 192
  year: 2005
  end-page: 203
  ident: br000055
  article-title: Measure and conquer: domination—a case study
  publication-title: Proceedings of ICALP 2005
– volume: 5
  start-page: 586
  year: 1992
  end-page: 595
  ident: br000075
  article-title: Labelling graphs with a condition at distance 2
  publication-title: SIAM Journal of Discrete Mathematics
– volume: vol. 6648
  start-page: 82
  year: 2011
  ident: 10.1016/j.tcs.2012.06.037_br000105
  article-title: Fast exact algorithm for L(2,1)-labeling of graphs
– volume: 49
  start-page: 585
  year: 2006
  ident: 10.1016/j.tcs.2012.06.037_br000020
  article-title: The L(h,k)-labelling problem: a survey and annotated bibliography
  publication-title: Computer Journal
  doi: 10.1093/comjnl/bxl018
– ident: 10.1016/j.tcs.2012.06.037_br000080
  doi: 10.1109/PROC.1980.11899
– ident: 10.1016/j.tcs.2012.06.037_br000090
– volume: 56
  start-page: 25:1
  issue: 5
  year: 2009
  ident: 10.1016/j.tcs.2012.06.037_br000060
  article-title: A measure and conquer approach for the analysis of exact algorithms
  publication-title: Journal of the ACM
  doi: 10.1145/1552285.1552286
– volume: vol. 4708
  start-page: 513
  year: 2007
  ident: 10.1016/j.tcs.2012.06.037_br000125
  article-title: Exact algorithms for L(2,1)-labeling of graphs
– volume: 113
  start-page: 59
  year: 2001
  ident: 10.1016/j.tcs.2012.06.037_br000045
  article-title: Fixed-parameter complexity of λ-labelings
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/S0166-218X(00)00387-5
– volume: 59
  start-page: 169
  year: 2011
  ident: 10.1016/j.tcs.2012.06.037_br000095
  article-title: Exact algorithms for L(2,1)-labeling of graphs
  publication-title: Algorithmica
  doi: 10.1007/s00453-009-9302-7
– volume: 306
  start-page: 1217
  year: 2006
  ident: 10.1016/j.tcs.2012.06.037_br000145
  article-title: A survey on labeling graphs with a condition at distance two
  publication-title: Discrete Mathematics
  doi: 10.1016/j.disc.2005.11.029
– volume: 309
  start-page: 3270
  year: 2009
  ident: 10.1016/j.tcs.2012.06.037_br000100
  article-title: The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
  publication-title: Discrete Mathematics
  doi: 10.1016/j.disc.2008.09.028
– ident: 10.1016/j.tcs.2012.06.037_br000130
– volume: 13
  start-page: 354
  year: 1969
  ident: 10.1016/j.tcs.2012.06.037_br000140
  article-title: Gaussian elimination is not optimal
  publication-title: Numerische Mathematik
  doi: 10.1007/BF02165411
– year: 2010
  ident: 10.1016/j.tcs.2012.06.037_br000065
– ident: 10.1016/j.tcs.2012.06.037_br000005
  doi: 10.1007/978-3-642-13580-4_1
– volume: vol. 3580
  start-page: 360
  year: 2005
  ident: 10.1016/j.tcs.2012.06.037_br000040
  article-title: Distance constrained labelings of graphs of bounded treewidth
– volume: 157
  start-page: 2646
  year: 2009
  ident: 10.1016/j.tcs.2012.06.037_br000070
  article-title: Graph labellings with variable weights, a survey
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/j.dam.2008.08.024
– volume: 9
  start-page: 309
  year: 1996
  ident: 10.1016/j.tcs.2012.06.037_br000025
  article-title: The L(2,1)-labeling problem on graphs
  publication-title: SIAM Journal of Discrete Mathematics
  doi: 10.1137/S0895480193245339
– volume: vol. 5757
  start-page: 566
  year: 2009
  ident: 10.1016/j.tcs.2012.06.037_br000135
  article-title: Dynamic programming on tree decompositions using generalised fast subset convolution
– volume: 111
  start-page: 727
  year: 2011
  ident: 10.1016/j.tcs.2012.06.037_br000030
  article-title: Channel assignment via fast zeta transform
  publication-title: Information Processing Letters
  doi: 10.1016/j.ipl.2011.05.008
– volume: 2
  start-page: 97
  year: 2008
  ident: 10.1016/j.tcs.2012.06.037_br000050
  article-title: Locally constrained graph homomorphisms—structure, complexity, and applications
  publication-title: Computer Science Review
  doi: 10.1016/j.cosrev.2008.06.001
– volume: 20
  start-page: 690
  year: 2006
  ident: 10.1016/j.tcs.2012.06.037_br000120
  article-title: Channel assignment problem with variable weights
  publication-title: SIAM Journal on Discrete Mathematics
  doi: 10.1137/040619636
– volume: vol. 6460
  start-page: 34
  year: 2011
  ident: 10.1016/j.tcs.2012.06.037_br000110
  article-title: On improved exact algorithms for L(2,1)-labeling of graphs
– volume: vol. 3380
  start-page: 192
  year: 2005
  ident: 10.1016/j.tcs.2012.06.037_br000055
  article-title: Measure and conquer: domination—a case study
– volume: 158
  start-page: 1777
  year: 2010
  ident: 10.1016/j.tcs.2012.06.037_br000035
  article-title: k-L(2,1)-labelling for planar graphs is NP-complete for k≥4
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/j.dam.2010.06.016
– volume: 5
  start-page: 586
  year: 1992
  ident: 10.1016/j.tcs.2012.06.037_br000075
  article-title: Labelling graphs with a condition at distance 2
  publication-title: SIAM Journal of Discrete Mathematics
  doi: 10.1137/0405048
– volume: 111
  start-page: 697
  year: 2011
  ident: 10.1016/j.tcs.2012.06.037_br000115
  article-title: On the complexity of exact algorithm for L(2,1)-labeling of graphs
  publication-title: Information Processing Letters
  doi: 10.1016/j.ipl.2011.04.010
– volume: 47
  start-page: 193
  year: 2004
  ident: 10.1016/j.tcs.2012.06.037_br000010
  article-title: Approximations for lambda-colorings of graphs
  publication-title: Computer Journal
  doi: 10.1093/comjnl/47.2.193
– volume: vol. 5757
  start-page: 35
  year: 2009
  ident: 10.1016/j.tcs.2012.06.037_br000085
  article-title: A linear time algorithm for L(2,1)-labeling of trees
– year: 1999
  ident: 10.1016/j.tcs.2012.06.037_br000015
  article-title: Graph classes: a survey
  publication-title: SIAM Monographs on Discrete Mathematics and Applications
SSID ssj0000576
Score 2.0867884
Snippet 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...
SourceID hal
crossref
elsevier
SourceType Open Access Repository
Enrichment Source
Index Database
Publisher
StartPage 42
SubjectTerms [formula omitted]-labeling
Computer Science
Data Structures and Algorithms
Exponential-time algorithm
Graphs
Title Fast exact algorithm for L(2,1)-labeling of graphs
URI https://dx.doi.org/10.1016/j.tcs.2012.06.037
https://hal.science/hal-00942917
Volume 505
WOSCitedRecordID wos000325905200006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20180131
  omitProxy: false
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLe6jgMc-BggxpcsxAEonhznw_Gxgk2DdRMSBfUWOY5DN5VkWtJS7cwfznPspN3QJnbgElWRY6V-v_g9v4_fQ-i1iEMmpaeI5-ucBGEakDSNfAKaIc4ixqlsyqO_j_jRUTyZiC-93u-2FmYx40URL5fi9L-KGu6BsE3p7A3E3U0KN-A3CB2uIHa4_pPg92RVD_TS1D7K2Y8SDv_Tn00y4chYkwM2MKvqDYw7gAAEbD06mIwNdXW1bqyO14oclev-MHAqs8u8mRdldS7J13NZHMtfrgv2gbU6685ff2Ci-Wq6aOLyH63beS0bCOzgWWn5IQ9NOqSerwJBVdVQdEwvZhM7R4VpGiGIrSVuC7RMEEbYRint5hvScG37tERbThFbcum_tnjrbTjZqZVhWzeu3GiHWuKYi3Tal9Rcl3zY5rWdJDBFYqZITG6fzzfQJuOhiPtoc_hpd_J5pdFDbmPe7g-00fEmT_DSe1xl32xMW099Y7mM76O77siBhxYqD1BPF1voXtvOA7vdfQvdOewofKuHKDY4wg2OcIcjDDjCI_wGM_wee_gt7hCEyxxbBD1C3_Z2xx_2iWuzQZTvezXhActkplQmQfHlNEjhBJnneZRKKbNAC-1HnlIU9CAVqTQDZCZhTZTMYo9L4T9G_aIs9BOEaSoCRSMB9lAaSB1KznQGSiOkKWMwdBvRdnES5TjoTSuUWXKlULbRu-6RU0vAct3goF3xxH0O1jJMAD3XPfYKpNNNbxjX94ejxNwzmbdMeHzhPb3JizxDt1efwHPUr8_m-gW6pRb1cXX20uHrD6nJmBY
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fast+exact+algorithm+for+L+%28+2+%2C+1+%29+-labeling+of+graphs&rft.jtitle=Theoretical+computer+science&rft.au=Junosza-Szaniawski%2C+Konstanty&rft.au=Kratochv%C3%ADl%2C+Jan&rft.au=Liedloff%2C+Mathieu&rft.au=Rossmanith%2C+Peter&rft.date=2013-09-23&rft.issn=0304-3975&rft.volume=505&rft.spage=42&rft.epage=54&rft_id=info:doi/10.1016%2Fj.tcs.2012.06.037&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2012_06_037
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon