 |
|
|
|
| HAL : hal-00460873, version 1 |
| DOI : 10.1007/s00453-009-9302-7 |
| Fiche détaillée |  Récupérer au format |
|
|
| Algorithmica 59, 2 (2011) 169-194 |
|
|
|
|
| Exact Algorithms for L(2,1)-Labeling of Graphs |
|
|
| Frédéric Havet 1Martin Klazar 2 |
|
|
| (2011) |
|
|
|
| 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, \dots ,k\}$ is an $L(2,1)$-labeling of $G$ of span $k$ if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common neighbor are mapped onto distinct integers. It is known that for any fixed $k\ge 4$, deciding the existence of such a labeling is an NP-complete problem. We present exact exponential time algorithms that are faster than the naive $O^*((k+1)^n)$ algorithm that would try all possible mappings. The improvement is best seen in the first NP-complete case of $k=4$, where the running time of our algorithm is $O(1.3006^n)$. Furthermore we show that dynamic programming can be used to establish an $O(3.8730^n)$ algorithm to compute an optimal $L(2,1)$-labeling. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | MASCOTTE (INRIA Sophia Antipolis / Laboratoire I3S) |
|
|
|
INRIA – Université de Nice Sophia Antipolis (UNS) – CNRS : UMR7271 |
|
|
| 2 : | Department of Applied Mathematics (KAM) (KAM) |
|
|
|
Univerzita Karlova v Praze |
|
|
| 3 : | Laboratoire d'Informatique Théorique et Appliquée (LITA) |
|
|
|
Université Paul Verlaine - Metz |
|
|
| 4 : | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Algorithme et structure de données |
| hal-00460873, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00460873 | |
| oai:hal.archives-ouvertes.fr:hal-00460873 | |
| Contributeur : Mathieu Liedloff | |
| Soumis le : Mardi 2 Mars 2010, 16:44:32 | |
| Dernière modification le : Mercredi 7 Mars 2012, 14:47:47 | |
