Distributed Edge Connectivity in Sublinear Time

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 343-354, 2019.

Cited by: 13|Bibtex|Views43|Links
EI
Keywords:
distributed computing edge connectivity graph algorithms

Abstract:

We present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity λ ...More

Code:

Data:

Your rating :
0

 

Tags
Comments