A Parallel Algorithm for Computing Minimum Spanning Trees
From MaRDI portal
Publication:4857538
DOI10.1006/jagm.1995.1043zbMath0836.68083OpenAlexW2050866845MaRDI QIDQ4857538
Donald B. Johnson, Panagiotis T. Metaxas
Publication date: 11 April 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://repository.wellesley.edu/computersciencefaculty/7
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Distributed algorithms (68W15)
Related Items
Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM, An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs, Recognizing and representing proper interval graphs in parallel using merging and sorting, Improving the efficiency of parallel minimum spanning tree algorithms
