ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Rainbow connectivity: hardness and tractability

Ananth, Prabhanjan and Nasre, Meghana and Sarpatwar, Kanthi K (2011) Rainbow connectivity: hardness and tractability. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) , 01-Dec, 2011, Dagstuhl, Germany.

[img] PDF
Fou_Sof_Tech_The_Com_Sci_13-1_241_2011.pdf - Published Version
Restricted to Registered users only

Download (406Kb) | Request a copy
Official URL: http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.241

Abstract

A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that G is (strongly) rainbow connected. In this paper we study the rainbow connectivity problem and the strong rainbow connectivity problem from a computational point of view. Our main results can be summarised as below: 1) For every fixed k >= 3, it is NP-Complete to decide whether src(G) <= k even when the graph G is bipartite. 2) For every fixed odd k >= 3, it is NP-Complete to decide whether rc(G) <= k. This resolves one of the open problems posed by Chakraborty et al. (J. Comb. Opt., 2011) where they prove the hardness for the even case. 3) The following problem is fixed parameter tractable: Given a graph G, determine the maximum number of pairs of vertices that can be rainbow connected using two colors. 4) For a directed graph G, it is NP-Complete to decide whether rc(G) <= 2.

Item Type: Conference Paper
Related URLs:
Additional Information: Copyright of this article belongs to Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.Germany.
Keywords: Computational Complexity;Rainbow Connectivity;Graph Theory;Fixed Parameter Tractable Algorithms
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 20 Mar 2013 09:13
Last Modified: 20 Mar 2013 09:13
URI: http://eprints.iisc.ernet.in/id/eprint/46050

Actions (login required)

View Item View Item