Biconnectivity, st-numbering and other applications of DFS using O(n) bits
Keywords: DFS; Space-efficient graph algorithms; Biconnectivity; 2-Edge connectivity; st-Numbering; Sparse spanning biconnected subgraph; Topological sort; Lowpoint;