Distributed edge connectivity in sublinear time

DOI10.1145/3313276.3316346zbMath1433.68598arXiv1904.04341OpenAlexW3102961801MaRDI QIDQ5212776

Thatchaphol Saranurak, Danupon Nanongkai, Mohit Daga, Monika R. Henzinger

Publication date: 30 January 2020

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

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

zbMATH Keywords

graph algorithmsdistributed computingedge connectivityCONGEST

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Distributed algorithms (68W15)

Related Items

Sublinear-time distributed algorithms for detecting small cliques and even cycles