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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 59; no. 2; pp. 169 - 194
Main Authors:	Havet, Frédéric, Klazar, Martin, Kratochvíl, Jan, Kratsch, Dieter, Liedloff, Mathieu
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.02.2011 Springer Springer Verlag
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!