1985/11/01 by Robert E. Tarjan, Uzi Vishkin · 13 citations
Computer Science · Engineering · Mathematics · #Interconnection Networks and Systems #Parallel Computing and Optimization Techniques #Low-power high-performance VLSI design #Computer science #Parallel algorithm #Speedup #Parallel computing #Binary logarithm #Adjacency list #Adjacency matrix #Computation #Combinatorics #Graph #Algorithm #Undirected graph #Running time #Data structure #Mathematics #Theoretical computer science
paper · doi:10.1137/0214061
openalex publication_date 1985/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in O(n + m) time and space on a graph of n vertices and m edges. A parallel implementation runs in O(log n) time and O(n + m) space using O(n + m) processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in O(n2 /p) time and O(n2 ) space using any number p \leqq n2 /log 2 n of processors, on a concurrent-read, exclusive-write parallel RAM. The last algorithm has optimal speedup, assuming an adjacency matrix representation of the input. A general algorithmic technique that simplifies and improves computation of various functions on trees is introduced. This technique typically requires O(log n) time using processors and O(n) space on an exclusive-read exclusive-write parallel RAM.