TY - GEN

T1 - FINDING BICONNECTED COMPONENTS AND COMPUTING TREE FUNCTIONS IN LOGARITHMIC PARALLEL TIME.

AU - Tarjan, Robert E.

AU - Vishkin, Uzi

PY - 1984/12/1

Y1 - 1984/12/1

N2 - A new algorithm is proposed for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in O(nm) time and space on a graph of n vertices and m edges. A parallel implementation runs in O(log n) time and O(nm) space using O(nm) processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in O(n**2 /p) time and O(n**2 ) space using any number p less than equivalent to n**2 /log**2 n of processors, on a concurrent-read, exclusive-write parallel RAM. The latter algorithm has optimal speed-up, assuming an adjacency matrix representation of the input.

AB - A new algorithm is proposed for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in O(nm) time and space on a graph of n vertices and m edges. A parallel implementation runs in O(log n) time and O(nm) space using O(nm) processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in O(n**2 /p) time and O(n**2 ) space using any number p less than equivalent to n**2 /log**2 n of processors, on a concurrent-read, exclusive-write parallel RAM. The latter algorithm has optimal speed-up, assuming an adjacency matrix representation of the input.

UR - http://www.scopus.com/inward/record.url?scp=0021555960&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021555960&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0021555960

SN - 081860591X

T3 - Annual Symposium on Foundations of Computer Science (Proceedings)

SP - 12

EP - 20

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -