Determining the l(2,1)-span in polynomial space

Authors:
Konstanty Junosza-Szaniawski;Jan Kratochvíl;Mathieu Liedloff;Paweł Rzążewski
Affiliations:
Faculty of Mathematics and Information Science, Warsaw University of Technology, Warszawa, Poland;Department of Applied Mathematics, and Institute for Theoretical Computer Science, Charles University, Praha 1, Czech Republic;Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans, Orléans Cedex 2, France;Faculty of Mathematics and Information Science, Warsaw University of Technology, Warszawa, Poland
Venue:
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Year:
2012

Citing 12
Cited 1

Labelling graphs with a condition at distance 2

SIAM Journal on Discrete Mathematics
Fixed parameter complexity of λ-labelings

Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
L(2,1)-labelling of graphs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Set Partitioning via Inclusion-Exclusion

SIAM Journal on Computing
k-L(2,1)-labelling for planar graphs is NP-complete for k≥4

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

Algorithmica
On improved exact algorithms for L(2, 1)-labeling of graphs

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
On the complexity of exact algorithm for L (2, 1)-labeling of graphs

Information Processing Letters
Channel assignment via fast zeta transform

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

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
The L(h, k)-Labelling Problem

The Computer Journal
Distance constrained labelings of graphs of bounded treewidth

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Determining the L(2,1)-span in polynomial space

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An L(2,1)-labeling of a graph is a mapping from its vertex set into a set of integers {0,..,k} such that adjacent vertices get labels that differ by at least 2 and vertices in distance 2 get different labels. The main result of the paper is an algorithm finding an optimal L(2,1)-labeling of a graph (i.e. an L(2,1)-labeling in which the largest label is the least possible) in time O*(7.4922n) and polynomial space. Moreover, a new interesting extremal graph theoretic problem is defined and solved.