An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM

DOI10.1006/jcss.1996.0078zbMath0870.68113OpenAlexW1978624651MaRDI QIDQ676443

Shay Halperin, Uri Zwick

Publication date: 7 September 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ff84ced32a0d569ee6d9d0a91c690d633885c164

zbMATH Keywords

randomised EREW PRAM algorithm

Mathematics Subject Classification ID

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

Related Items (3)

Many Random Walks Are Faster Than One ⋮ Constructing Light Spanners Deterministically in Near-Linear Time ⋮ Constructing light spanners deterministically in near-linear time

This page was built for publication: An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM