Massively parallel minimum spanning tree in general metric spaces

DOI10.1137/1.9781611978322.5MaRDI QIDQ7289560zbMATH OpenFDO

Authors Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Łącki, Vahab S. Mirrokni, Peilin Zhong

Publication date 3 July 2026

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Fully scalable MPC algorithms for Euclidean k-center

This page was built for publication: Massively parallel minimum spanning tree in general metric spaces

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