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

Podrobná bibliografia

Vydané v:	25th Annual Symposium onFoundations of Computer Science, 1984 s. 12 - 20
Hlavní autori:	Tarjan, R.E., Vishkin, U.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 1984
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!