Sankardeep Chakraborty

activity

20162026

most citedIndexing Graph Search Trees and Applications

2 citations · 4 across the 8 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.DS2016

Biconnectivity, $s t$ -numbering and other applications of DFS using $O (n)$ 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 $2$ -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…

Biconnectivity, st-numbering and other applications of DFS using O(n) bits

Improved Space efficient linear time algorithms for BFS, DFS and applications

Biconnectivity, $s t$ -numbering and other applications of DFS using $O (n)$ bits