3 citations · 3 across the 1 of their papers we have counts for
2 papers
math.CO2008★ 3 cited
Hardness and Algorithms for Rainbow Connection
Sourav Chakraborty, Eldar Fischer, Arie Matsliah +1
An edge-colored graph is {\em rainbow connected} if any two vertices are connected by a path whose edges have distinct colors. The {\em rainbow connection} of a connected graph…
cs.CC2005
On the Sensitivity of Cyclically-Invariant Boolean Functions
Sourav Chakraborty
In this paper we construct a cyclically invariant Boolean function whose sensitivity is . This result answers two previously published questions. Turán (1984) asked if…