21 citations · 21 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Improved Algorithm for Min-Cuts in Distributed Networks
Mohit Daga
In this thesis, we present fast deterministic algorithm to find small cuts in distributed networks. Finding small min-cuts for a network is essential for ensuring the quality of se…
cs.DS2019★ 21 cited
Distributed Edge Connectivity in Sublinear Time
Mohit Daga, Monika Henzinger, Danupon Nanongkai +1
We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity exactly in the CONGEST model, as long as there are no…