Hardness and Algorithms for Rainbow Connectivity

Abstract : An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In addition to being a natural combinatorial problem, the rainbow connectivity problem is motivated by applications in cellular networks. In this paper we give t he first proof that computing rc(G) is NP-Hard. In fact, we prove that it is already NP-Complete to decide if rc(G) = 2, and also that it is NP-Complete to decide whether a given edge-colored (with an unbounded number of colors) graph is rainbow connected. On the positive side, we prove that for every ǫ > 0, a connected graph with minimum degree at least ǫn has bounded rainbow connectivity, where the bound depends only on ǫ, and the corresponding coloring can be constructed in polynomial time. Additional non-trivial upper bounds, as well as open problems and conjectures are also pre sented.
Type de document :
Communication dans un congrès
Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.243-254, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00359276
Contributeur : Publications Loria <>
Soumis le : lundi 16 février 2009 - 15:44:31
Dernière modification le : mercredi 20 décembre 2017 - 17:42:07
Document(s) archivé(s) le : mercredi 22 septembre 2010 - 11:34:38

Fichiers

new.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00359276, version 2
  • ARXIV : 0902.1255

Collections

Citation

Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster. Hardness and Algorithms for Rainbow Connectivity. Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.243-254, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00359276v2〉

Partager

Métriques

Consultations de la notice

84

Téléchargements de fichiers

436