A deterministic algorithm for the MST problem in constant rounds of congested clique

DOI10.1145/3406325.3451136arXiv1912.04239MaRDI QIDQ6065240

Krzysztof Nowicki

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.04239

zbMATH Keywords

MSTdeterministic algorithmsparallel algorithmsgraph algorithmsminimum spanning treedistributed algorithmsmapreducemassively parallel algorithmscongested clique

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Deterministic Massively Parallel Connectivity ⋮ Distributed Symmetry Breaking on Power Graphs via Sparsification ⋮ Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?

This page was built for publication: A deterministic algorithm for the MST problem in constant rounds of congested clique