375 citations · 494 across the 29 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
Biconnectivity, -numbering and other applications of DFS using bits
Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
We consider space efficient implementations of some classical applications of DFS including the problem of testing biconnectivity and -edge connectivity, finding cut vertices an…
cs.DS2016★ 1 cited
Improved Space efficient linear time algorithms for BFS, DFS and applications
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman +1
Recent work by Elmasry et al. (STACS 2015) and Asano et al. (ISAAC 2014), reconsidered classical fundamental graph algorithms focusing on improving the space complexity. We continu…