Sub-linear distributed algorithms for sparse certificates and biconnected components

DOI10.1145/224964.224968zbMath1376.68163OpenAlexW2007004331MaRDI QIDQ5361432

Ramakrishna Thurimella

Publication date: 29 September 2017

Published in: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Distributed algorithms (68W15)

Related Items (5)

Fast Distributed Approximation for TAP and 2-Edge-Connectivity ⋮ A distributed algorithm for directed minimum-weight spanning tree ⋮ A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms ⋮ Fast distributed approximation for TAP and 2-edge-connectivity ⋮ On mixed connectivity certificates

This page was built for publication: Sub-linear distributed algorithms for sparse certificates and biconnected components