23 citations · 42 across the 17 of their papers we have counts for
1 paper · 2 filters
David Pritchard
We describe a synchronous distributed algorithm which identifies the edge-biconnected components of a connected network. It requires a leader, and uses messages of size O(log |V|).…