A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Biconnectivity, st-numbering and other applications of DFS using O(n) bits
[article]
2017
arXiv
pre-print
We consider space efficient implementations of some classical applications of DFS including the problem of testing biconnectivity and 2-edge connectivity, finding cut vertices and cut edges, computing chain decomposition and st-numbering of a given undirected graph G on n vertices and m edges. Classical algorithms for them typically use DFS and some Ω ( n) bits[We use to denote logarithm to the base 2.] of information at each vertex. Building on a recent O(n)-bits implementation of DFS due to
arXiv:1606.08645v3
fatcat:ognvs4na2vc2flf4u3vk6tljey