19 citations · 56 across the 28 of their papers we have counts for
Showing 2011 · cs.DMShow all
2 papers · 2 filters
cs.DM2011
An Algebraic Characterization of Rainbow Connectivity
Prabhanjan Ananth, Ambedkar Dukkipati
The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We firs…
cs.DM2011★ 1 cited
Hardness and Parameterized Algorithms on Rainbow Connectivity problem
Prabhanjan Ananth, Meghana Nasre, Kanthi K Sarpatwar
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…