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

The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G =( V , E ) into an interval of integers {0,…, k } is an L (2,1)-labeling of G of span k if any two adjacent vertices are mapped onto integer...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 59; číslo 2; s. 169 - 194
Hlavní autoři:	Havet, Frédéric, Klazar, Martin, Kratochvíl, Jan, Kratsch, Dieter, Liedloff, Mathieu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.02.2011 Springer Springer Verlag
Témata:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer systems and distributed systems. User interface Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Mathematics of Computing Software Theoretical computing Theory of Computation (2,1)-labeling Graph Algorithm Moderately exponential time algorithm L(2, 1)-labeling Frequency allocation Graph colouring NP complete problem Vertex(graph) Dynamic programming Graph labelling
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!