Parallel algorithms for verification and sensitivity analysis of minimum spanning trees

To verify whether a spanning tree T(V,E) of graph G(V,E') is a minimum spanning tree, two parallel algorithms are presented. The first algorithm requires O(log n) time and O(max{m/log n, n/sup 3/2//log n}) processors, where |E'|=m and |V|=n. The second algorithm requires O(log n) time and O(m) processors or O(log nloglog n) time and O(max{m/log n, n}) processors. The first algorithm is optimal when G is dense, compared with its O(m) time sequential version. The second algorithm has better performance when G is sparse. By using above results, we also present an efficient algorithm for sensitivity analysis of minimum spanning trees which requires O(log n) time and O(max{m, n/sup 2//log n}) processors. All proposed algorithms in this paper are based on the parallel computational model called CREW PRAM.

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

[2]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[3]  Richard Cole,et al.  Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  David G. Kirkpatrick,et al.  A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.

[5]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.

[6]  Uzi Vishkin,et al.  Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs , 1986, Theor. Comput. Sci..

[7]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[9]  Weifa Liang,et al.  A parallel algorithm for multiple edge updates of minimum spanning trees , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[10]  John H. Reif,et al.  Depth-First Search is Inherently Sequential , 1985, Inf. Process. Lett..

[11]  Yung H. Tsin.  Finding Lowest Common Ancestors in Parallel , 1986, IEEE Transactions on Computers.

[12]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[13]  Peter J. Varman,et al.  A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees , 1986, ICALP.

[14]  Francis Y. L. Chin,et al.  Efficient parallel algorithms for some graph problems , 1982, CACM.

[15]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[16]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[17]  Yung H. Tsin,et al.  Efficient Parallel Algorithms for a Class of Graph Theoretic Problems , 1984, SIAM J. Comput..

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

[19]  I. V. Ramakrishnan,et al.  Parallel Updates of Graph Properties in Logarithmic Time , 1985, ICPP.

[20]  Robert E. Tarjan,et al.  Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees , 1982, Inf. Process. Lett..

[21]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

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

[23]  Noga Alon,et al.  OPTIMAL PREPROCESSING FOR S ANSWERING ON-LINE PRODUCT QUERIE , 1987 .