Finding biconnected componemts and computing tree functions in logarithmic parallel time

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,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:25th Annual Symposium onFoundations of Computer Science, 1984 s. 12 - 20
Hlavní autoři: Tarjan, R.E., Vishkin, U.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1984
Témata:
Computational modeling
Computer science
Concurrent computing
Parallel algorithms
Phase change random access memory
Random access memory
Read-write memory
Tree graphs
US Department of Energy
Writing
ISBN:081860591X, 9780818605918
ISSN:0272-5428
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 ⩽ 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.
ISBN:081860591X
9780818605918
ISSN:0272-5428
DOI:10.1109/SFCS.1984.715896