Optimal Graph Algorithms on a Fixed-Size Linear Array
IEEE Transactions on Computers
Parallel tree pattern matching
Journal of Symbolic Computation
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
METANET: principles of an arbitrary topology LAN
IEEE/ACM Transactions on Networking (TON)
Incomparability in parallel computation
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Biconnected structure for multi-robot systems
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Paper: Parallel computation of matchings in trees
Parallel Computing
An efficient parallel algorithm for building the separating tree
Journal of Parallel and Distributed Computing
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
Theoretical Computer Science
An optimal distributed algorithm for finding articulation points in a network
Computer Communications
Adapting parallel algorithms to the W-stream model, with applications to graph problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Brief announcement: truly parallel burrows-wheeler compression and decompression
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.01 |
In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in 0[n+m] time and space on a graph of n vertices and m edges. A parallel implmentation runs in 0[log n] time and 0[n+m] space using 0[n+m] processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in 0[n/sup 2/p] time and 0[n/sup 2/] space using any number p /spl les/ n/sup 2/log/sup 2/-n of processors, on a concurrent-read, exclusive-write parallel RAM. The latter algorithm has optimal speedup, assuming an adjacency matrix representation of the input. A general algorithmic technique which simplifies and improve computation of various functions on tress is introduced. This technique typically requires 0(log n) time using 0(n) space on an exclusive-read exclusive-write parallel RAM.