Fast Connected Components Algorithms for the EREW PRAM

DOI10.1137/S009753979325247XzbMath0918.68042OpenAlexW2025220494MaRDI QIDQ4229421

Noam Nisan, Michal Parnas, David R. Karger

Publication date: 22 February 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979325247x

zbMATH Keywords

connected componentsrandom walksparallel algorithmsgraph algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sums of independent random variables; random walks (60G50) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Distributed algorithms (68W15)

Related Items (5)

Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM ⋮ Graph Connectivity in Log Steps Using Label Propagation ⋮ Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality ⋮ Active exploration for large graphs ⋮ Many Random Walks Are Faster Than One

This page was built for publication: Fast Connected Components Algorithms for the EREW PRAM