Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time

Algorithmica (New York)

Volumn 17, Issue 1, 1997, Pages 11-18

  Dixon, B ^a   Tarjan, R E ^b,c  

^a Department of Computer Science   (United States)

^b Princeton University   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

Minimum spanning tree; Network optimization; Sensitivity analysis; Verification algorithms

Indexed keywords

EID: 0008873343     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02523235     Document Type: Article

References (16)

1. N. Alon and B. Schieber, Optimal Preprocessing for Answering On-Line Product Queries, Unpublished manuscript.
2. B. Awerbuch and Y. Shiloach, New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM, IEEE Trans. Comput. 36(10) (1987), 1258-1263.
3. H. Booth and J. Westbrook, Linear Algorithms for Analysis of Minimum Spanning and Shortest Path Trees in Planar Graphs, TR-768, Department of Computer Science, Yale University, Feb. 1990.
4. R. Cole, P. Klein, and R. E. Tarjan, A Linear-work Parallel Algorithm for Finding Minimum Spanning Trees, Proc. 6th ACW Symp. on Parallel Algorithms and Architectures, 1994.
5. B. Dixon, M. Rauch, and R. E. Tarjan, Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time, SIAM J. Comput. 21(6) (1992), 1184-1192.
6. H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan, Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs, Combinatorica 6(2) (1986), 109-122.
7. D. Harel and R. E. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM J. Comput. 13(2) (1984), 338-355.
8. D. B. Johnson and P. Metaxas, A Parallel Algorithm for Computing Minimum Spanning Trees, Proc. 4th ACM Svmp. on Parallel Algorithms and Architectures, 1992, pp. 363-372.
9. R. Karp and V. Ramachandran, Parallel Algorithms for Shared Memory Machines, Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, Chapter 17.
10. V. King, A Simpler Minimum Spanning Tree Verification Algorithm, Manuscript, 1994.
11. P. Klein and R. E. Tarjan, A Randomized Linear Time Algorithm for Finding Minimum Spanning Trees, Proc. 26th Annual ACM Symp. on Theory of Computing, 1994.
12. J. H. Reif, An Optimal Parallel Algorithm for Integer Sorting, Proc. 26th Annual ACM Symp. on Foundations of Computer Science, 1985, pp. 496-504.
13. R. E. Tarjan, Applications of Path Compressions on Balanced Trees, J. Assoc. Comput. Mach. 26(4) (1979), 690-715.
14. R. E. Tarjan, Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees, Inform. Process. Lett. 14(1) (1982), 30-33. Corrigendum, ibid. 23 (1986), 219.
15. R. E. Tarjan, Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees, Inform. Process. Lett. 14(1) (1982), 30-33. Corrigendum, ibid. 23 (1986), 219.
16. R. E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.