Congested Clique Algorithms for the Minimum Cut Problem

DOI10.1145/3212734.3212750zbMath1428.68380OpenAlexW2810492404MaRDI QIDQ5197700

Mohsen Ghaffari, Krzysztof Nowicki

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3212734.3212750

zbMATH Keywords

minimum cutapproximation algorithmscongested clique

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (4)

Fault-tolerant graph realizations in the congested clique ⋮ Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? ⋮ Fast approximate shortest paths in the congested clique ⋮ Near-optimal scheduling in the congested clique

This page was built for publication: Congested Clique Algorithms for the Minimum Cut Problem