Practical Parallel Algorithms for Minimum Spanning Trees (1998)

by Frank Dehne , Silvia Götz
Venue:In Workshop on Advances in Parallel and Distributed Systems
Citations:17 - 0 self

Active Bibliography

13 Communication-Optimal Parallel Minimum Spanning Tree Algorithms – Micah Adler, Wolfgang Dittrich, Ben Juurlink, Miroslaw Kutylowski, Ingo Rieping - 1998
30 A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs) (Extended Abstract) – David A. Bader, Guojing Cong - 2004
192 Programming Parallel Algorithms – Guy E. Blelloch - 1996
16 Concurrent Threads and Optimal Parallel Minimum Spanning Trees Algorithm – Ka Wong Chong, Yijie Han, Tak-Wah Lam - 2001
21 Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs – David A. Bader , Guojing Cong - 2006
6 On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees – Ka Wong Chong, Yijie Han, Tak Wah Lam - 1999
12 An Optimal Randomized Logarithmic Time Connectivity Algorithm for the EREW PRAM – Shay Halperin, Uri Zwick - 1996
10 Optimal randomized EREW PRAM algorithms for finding spanning forests – Shay Halperin, Uri Zwick - 2000
Feasibility, Portability, . . . Grained Graph Algorithms – Isabelle Guérin Lassous, Jens Gustedt, Michel Morvan - 2000
27 Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators – Adam L. Buchsbaum , Haim Kaplan, Anne Rogers, Jeffery R. Westbrook - 1998
2 Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits – Seth Pettie
STUDY OF PARALLEL GRAPH ALGORITHMS FOR MINIMUM SPANNING TREE AND ALL-PAIRS SHORTEST-PATHS USING A LARGE SCALE CLUSTER APPROVED: – Bipul Kumar Sen, Bipul Kumar Sen - 2006
19 Finding minimum spanning forests in logarithmic time aud linear work using . . . – Richard Cole, Philip N. Klein, Robert E. Tarjan - 1996
14 A linear-work parallel algorithm for finding . . . – Richard Cole, Philip N. Klein, Robert E. Tarjan - 1994
The Handling of Graphs on PC Clusters: A Coarse Grained Approach – Isabelle Guérin Lassous, Jens Gustedt, Michel Morvan - 2000
16 CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters – Albert Chan, Frank Dehne - 2003
A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREE – M. I. Moussa, E. M. Badr - 2013
30 BSP vs LogP – Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul Spirakis - 1996
8 Bulk Synchronous Parallel Algorithms for the External Memory Model – Frank Dehne, Wolfgang Dittrich, David Hutchinson, Anil Maheshwari - 2002