Highly Influenced

# Almost-Tight Distributed Minimum Cut Algorithms

@inproceedings{Nanongkai2014AlmostTightDM, title={Almost-Tight Distributed Minimum Cut Algorithms}, author={Danupon Nanongkai and Hsin-Hao Su}, booktitle={DISC}, year={2014} }

- Published 2014 in DISC
DOI:10.1007/978-3-662-45174-8_30

We study the problem of computing the minimum cut in a weighted distributed messagepassing networks (the CONGEST model). Let λ be the minimum cut, n be the number of nodes (processors) in the network, and D be the network diameter. Our algorithm can compute λ exactly in O(( √ n log∗ n+D)λ log n) time. To the best of our knowledge, this is the first paper that explicitly studies computing the exact minimum cut in the distributed setting. Previously, non-trivial sublinear time algorithms for this… CONTINUE READING

Highly Cited

This paper has 40 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-10 of 25 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential