31 citations · 61 across the 13 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 5 cited
Almost-Tight Distributed Minimum Cut Algorithms
Danupon Nanongkai, Hsin-Hao Su
We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let be the minimum cut, be the number of nodes in…
cs.DS2014
A Distributed Minimum Cut Approximation Scheme
Hsin-Hao Su
In this paper, we study the problem of approximating the minimum cut in a distributed message-passing model, the CONGEST model. The minimum cut problem has been well-studied in the…