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

Documents Related by Co-Citation

636 An Introduction to Parallel Algorithms – J J'aJ'a - 1992
17 Parallel Implementation of Boruvka’s Minimum Spanning Tree Algorithm – S Chung, A Condon - 1996
12 Connected Components Algorithms For Mesh-Connected Parallel Computers – Steve Goddard, Subodh Kumar, Jan, Jan F. Prins - 1995
30 A Parallel Algorithm for Computing Minimum Spanning Trees – Donald B. Johnson, Panagiotis Metaxas - 1992
31 A Comparison of Data-Parallel Algorithms for Connected Components – John Greiner - 1994
20 Designing Practical Efficient Algorithms for Symmetric Multiprocessors (Extended Abstract) – David R. Helman, Joseph JaJa - 1999
1130 A Bridging Model for Parallel Computation – L G Valiant - 1990
22 Connected Components on Distributed Memory Machines – Arvind Krishnamurthy, Steven S. Lumetta, David E. Culler, Katherine Yelick - 1994
25 Parallel Implementation of Algorithms for Finding Connected Components in Graphs – Tsan-Sheng Hsu, Vijaya Ramachandran, Nathaniel Dean - 1997
64 Communication-Efficient Parallel Sorting – Michael Goodrich - 1996
16 Concurrent Threads and Optimal Parallel Minimum Spanning Trees Algorithm – Ka Wong Chong, Yijie Han, Tak-Wah Lam - 2001
53 SIMPLE: A methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs – David A. Bader, Joseph Jaja - 1999
637 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
86 Scalable parallel geometric algorithms for coarse grained multicomputers – F Dehne, A Fabri, A Rau-Chaplin - 1993
59 Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Extended Abstract) – E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, S. W. Song - 1997
13 Communication-Optimal Parallel Minimum Spanning Tree Algorithms – Micah Adler, Wolfgang Dittrich, Ben Juurlink, Miroslaw Kutylowski, Ingo Rieping - 1998
63 Efficient parallel algorithms for some graph problems – F Chin J Lam, I Chen - 1982
19 Finding minimum spanning forests in logarithmic time aud linear work using . . . – Richard Cole, Philip N. Klein, Robert E. Tarjan - 1996
30 New connectivity and MSF algorithms for shuffleexchange network and PRAM – B Awerbuch, Y Shiloach - 1987