A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees (1994)

Cached

Download Links

by Richard Cole , Philip N. Klein , Robert E. Tarjan
Citations:13 - 1 self

Active Bibliography

18 Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling – Richard Cole, Philip N. Klein, Robert E. Tarjan - 1996
12 An Optimal Randomized Logarithmic Time Connectivity Algorithm for the EREW PRAM – Shay Halperin, Uri Zwick - 1996
98 A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees – David R. Karger , Philip N. Klein, Robert E. Tarjan - 1994
25 Fast Connected Components Algorithms For The EREW PRAM – David R. Karger, Noam Nisan, Michal Parnas - 1999
14 Connected Components in O(log 3/2 n) Parallel Time for the CREW PRAM – Donald B. Johnson, Panagiotis Metaxas
14 Concurrent Threads and Optimal Parallel Minimum Spanning Trees Algorithm – Ka Wong Chong, Yijie Han, Tak-Wah Lam - 2001
9 Optimal randomized EREW PRAM algorithms for finding spanning forests – Shay Halperin, Uri Zwick - 2000
27 A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs) (Extended Abstract) – David A. Bader, Guojing Cong - 2004
1 Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits – Seth Pettie
28 A Parallel Algorithm for Computing Minimum Spanning Trees – Donald B. Johnson, Panagiotis Metaxas - 1992
15 On the architectural requirements for efficient execution of graph algorithms – David A. Bader, John Feo, Guojing Cong - 2005
11 A randomized time-work optimal parallel algorithm for finding a minimum spanning forest – Seth Pettie, Vijaya Ramachandran - 1999
5 On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees – Ka Wong Chong, Yijie Han, Tak Wah Lam - 1999
164 Programming Parallel Algorithms – Guy E. Blelloch - 1996
4 Minimizing Randomness in Minimum Spanning Tree, Parallel Connectivity, and Set Maxima Algorithms – Seth Pettie, Vijaya Ramachandran - 2001
13 Communication-Optimal Parallel Minimum Spanning Tree Algorithms – Micah Adler, Wolfgang Dittrich, Ben Juurlink, Miroslaw Kutylowski, Ingo Rieping - 1998
14 Practical Parallel Algorithms for Minimum Spanning Trees – Frank Dehne, Silvia Götz - 1998
1 A Few Remarks On The History Of MST-Problem – Jaroslav Nesetril - 1997
Finding Connected Components in Graphs – TSAN-SHENG HSU, VIJAYA RAMACHANDRAN, Nathaniel Dean - 1996