Biconnectivity, $st$-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…