Abstract. We present a randomized parallel algorithm to find a minimum spanning forest (MSF) in a weighted, undirected graph. On an EREW PRAM our algorithm runs in logarithmic time and linear work w.h.p. This is both time and work optimal and is the first provably optimal parallel algorithm under both measures. 1
|
1289
|
The Probabilistic Method
– Alon, Spencer
- 1992
|
|
970
|
A bridging model for parallel computation
– Valiant
- 1997
|
|
658
|
A Note on Two Problems in Connexion with Graphs. Numerische Mathematik
– Dijkstra
- 1959
|
|
320
|
Shortest connection networks and some generalizations
– Prim
- 1957
|
|
281
|
Parallel algorithms for shared-memory machines
– Karp, Ramachandran
- 1990
|
|
89
|
A randomized linear-time algorithm for finding minimum spanning trees
– Karger, Klein, et al.
- 1995
|
|
51
|
Can a shared-memory model serve as a bridging model for parallel computation
– Gibbons, Mattias, et al.
- 1997
|
|
50
|
The QRQW PRAM: Accounting for contention in parallel algorithms
– Gibbons, Matias, et al.
- 1994
|
|
50
|
Efficient low-contention parallel algorithms
– Gibbons, Matias, et al.
- 1994
|
|
41
|
An optimal randomized parallel algorithm for finding connected components in a graph
– Gazit
- 1991
|
|
39
|
An optimal minimum spanning tree algorithm
– Pettie, Ramachandran
|
|
34
|
New connectivity and MSF algorithms for shuffle-exchange network and PRAM
– Awerbuch, Shiloach
- 1987
|
|
33
|
A simpler minimum spanning tree verification algorithm
– King
- 1997
|
|
15
|
Sorting on a parallel pointer machine with applications to set expression evaluation
– Goodrich, Kosaraju
- 1989
|
|
14
|
Concurrent threads and optimal parallel minimum spanning trees algorithm
– Chong, Han, et al.
- 2001
|
|
14
|
A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees
– Cole, Klein, et al.
- 1994
|
|
14
|
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM
– Halperin, Zwick
- 1994
|
|
12
|
A randomized linear work EREW PRAM algorithm to find a minimum spanning forest
– Poon, Ramachandran
- 1997
|
|
11
|
Connected components in O(log 3/2 |V |) parallel time for the CREW PRAM
– Johnson, Metaxas
- 1991
|
|
11
|
An optimal EREW PRAM algorithm for minimum spanning tree verification
– King, Poon, et al.
- 1997
|
|
10
|
Optimal randomized EREW PRAM algorithms for finding spanning forests
– Halperin, Zwick
- 2001
|
|
9
|
New connectivity and MSF algorithms for shu e-exchange network and PRAM
– Awerbuch, Shiloach
- 1987
|
|
8
|
Minimizing randomness in minimum spanning tree, parallel connectivity and set maxima algorithms
– Pettie, Ramachandran
|
|
5
|
private communication
– Ramachandran
- 1995
|
|
5
|
On the parallel time complexity of undirected connectivity and minimum spanning trees
– Chong, Han, et al.
|
|
5
|
A simpler minimum spanning tree veri cation algorithm
– King
- 1997
|
|
5
|
A randomized linear-time algorithm to nd minimum spanning trees
– Karger, Klein, et al.
- 1995
|
|
4
|
Finding minimum spanning trees in logarithmic time and linear work using random sampling
– Cole, Klein, et al.
- 1996
|
|
4
|
Optimal randomized erew pram algorithms for nding spanning forests and for other basic graph connectivity problems
– Halperin, Zwick
- 1996
|
|
3
|
O jist'em probl'emu minima'aln ' im. Moravsk'e Pr ' irodovedeck'e Spolecnosti 3
– Boruvka
- 1926
|
|
3
|
ik. O jist'em probl'emu minima'aln ' im. Moravsk'e Pr ' irodovedeck'e Spolecnosti 6
– Jarn
- 1930
|
|
3
|
A linear-work parallel algorithm for nding minimum spanning trees
– Cole, Klein, et al.
- 1994
|
|
3
|
An optimal randomized parallel algorithm for nding connected components in a graph
– Gazit
- 1991
|
|
1
|
O jistem problemu minimaalnim. Moravske Prirodovedecke Spolecnosti 6
– Jarnik
- 1930
|
|
1
|
uvka, O jistem problemu minimaaln im, Moravske Pr irodovedecke Spolecnosti
– Bor
- 1926
|
|
