Fast Connected Components Algorithms for the EREW PRAM

We present fast and efficient parallel algorithms for finding the connected components of an undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using $(m+n^{1+\epsilon})/\lo...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	SIAM journal on computing Ročník 28; číslo 3; s. 1021 - 1034
Hlavní autori:	Karger, David R., Nisan, Noam, Parnas, Michal
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.1998
Predmet:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer science Computer science; control theory; systems Exact sciences and technology Graph theory Information retrieval. Graph Markov processes Mathematics Neighborhoods Probability and statistics Probability theory and stochastic processes Sciences and techniques of general use Theoretical computing Parallel algorithm Random access memory(RAM) Graph theory Fast algorithm Random walk Deterministic algorithms
ISSN:	0097-5397, 1095-7111
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!