5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DS2016★ 1 cited
Distributed Degree Splitting, Edge Coloring, and Orientations
Mohsen Ghaffari, Hsin-Hao Su
We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such tha…
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…