Deterministic massively parallel connectivity

DOI10.1137/22M1520177MaRDI QIDQ6830451zbMATH OpenFDO

Authors Artur Czumaj

Publication date 14 November 2023

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

Full work available at URL https://wrap.warwick.ac.uk/164730/1/WRAP-Deterministic-massively-parallel-connectivity-Coy-2022.pdf

zbMATH Keywords

connectivityderandomizationMapReducemassively parallel algorithmsMPC

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Cited in

(1)

• Log-diameter MST verification and sensitivity in MPC

This page was built for publication: Deterministic massively parallel connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830451)