38 citations · 178 across the 46 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013★ 4 cited
Distributed Connectivity Decomposition
Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their pr…
cs.DS2013★ 26 cited
Distributed Minimum Cut Approximation
Mohsen Ghaffari, Fabian Kuhn
We study the problem of computing approximate minimum edge cuts by distributed algorithms. We use a standard synchronous message passing model where in each round, bits…
cs.DM2013
A New Perspective on Vertex Connectivity
Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn
Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge…