An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification

Abstract We present a deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m edges in O ( log n ) time and O( m + n ) work. The algorithm is a parallelization of King's linear time sequential algorithm for the problem.

[1]  Robert E. Tarjan,et al.  Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time , 1992, SIAM J. Comput..

[2]  Uri Zwick,et al.  Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems , 1996, SODA '96.

[3]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .

[4]  Yossi Matias,et al.  The QRQW PRAM: accounting for contention in parallel algorithms , 1994, SODA '94.

[5]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[6]  D. Karger,et al.  Random sampling in graph optimization problems , 1995 .

[7]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[8]  Chung Keung Poon,et al.  A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest , 1997, Algorithmica.

[9]  Gary L. Miller,et al.  Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits , 1988, SIAM J. Comput..

[10]  János Komlós.  Linear verification for spanning trees , 1985, Comb..

[11]  Arthur L. Delcher,et al.  Optimal Parallel Evaluation of Tree-Structured Computations by Raking , 1988, AWOC.

[12]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[13]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..

[14]  Valerie King.  A Simpler Minimum Spanning Tree Verification Algorithm , 1995, WADS.

[15]  Robert E. Tarjan,et al.  Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time , 1994, Canada-France Conference on Parallel and Distributed Computing.

[16]  Tak Wah Lam,et al.  Finding connected components in O(log n loglog n) time on the EREW PRAM , 1993, SODA '93.

[17]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[18]  Robert E. Tarjan,et al.  Applications of Path Compression on Balanced Trees , 1979, JACM.