A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest

DOI10.1007/S00453-002-0998-XzbMath1045.68164OpenAlexW219725727MaRDI QIDQ1400887

Chung Keung Poon, Vijaya Ramachandran

Publication date: 17 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0998-x

zbMATH Keywords

Parallel algorithmsRandomized algorithmsEREW PRAMMinimum spanning treeDesign of algorithms\(n\)-vertex graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (2)

Parallel time and space upper-bounds for the subset-sum problem ⋮ Improving the efficiency of parallel minimum spanning tree algorithms

This page was built for publication: A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest