Hardness and Algorithms for Rainbow Connectivity

Details Hardness and Algorithms for Rainbow Connectivity Hardness and Algorithms for Rainbow Connectivity

2009-02-07

arxiv.org/abs/0902.1255v2

26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 243-254

Computer Science

Computational Complexity

Scientific paper

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 the 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 $\epsilon$ > 0, a connected graph with minimum degree at least $\epsilon n$ has bounded rainbow connectivity, where the bound depends only on $\epsilon$, 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.

Affiliated with

Also associated with

No associations

Rating

Hardness and Algorithms for Rainbow Connectivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hardness and Algorithms for Rainbow Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hardness and Algorithms for Rainbow Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-312175