Optimal parallel verification of minimum spanning trees in logarithmic time

This publication has 11 references indexed in Scilit:

• A randomized linear-time algorithm for finding minimum spanning trees
  Published by Association for Computing Machinery (ACM) ,1994
• Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
  SIAM Journal on Computing, 1992
• A parallel algorithm for computing minimum spanning trees
  Published by Association for Computing Machinery (ACM) ,1992
• New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
  IEEE Transactions on Computers, 1987
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
  Combinatorica, 1986
• An optimal parallel algorithm for integer sorting
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Fast Algorithms for Finding Nearest Common Ancestors
  SIAM Journal on Computing, 1984
• Data Structures and Network Algorithms
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1983
• Sensitivity analysis of minimum spanning trees and shortest path trees
  Information Processing Letters, 1982
• Applications of Path Compression on Balanced Trees
  Journal of the ACM, 1979