![Theoretical computer science / Graph connectivity / Network flow / Cut / Randomized algorithm / Max-flow min-cut theorem / Maximum flow problem / Connectivity / Minimum cut / Graph theory / Mathematics / Combinatorial optimization Theoretical computer science / Graph connectivity / Network flow / Cut / Randomized algorithm / Max-flow min-cut theorem / Maximum flow problem / Connectivity / Minimum cut / Graph theory / Mathematics / Combinatorial optimization](https://www.pdfsearch.io/img/6dcb529d3a2ce21138803cbeb3c0e42f.jpg)
| Document Date: 2011-01-18 10:58:41 Open Document File Size: 138,95 KBShare Result on Facebook
Country Israel / / / Facility Tel Aviv University / / IndustryTerm network flow algorithm / recursive contraction algorithm / min-cut algorithm / celebrated max-flow min-cut algorithm / recursive random contraction algorithm / elegant solution / deterministic and randomized algorithms / random contraction algorithm / / Organization School of Computer Science / Tel Aviv University / Tel Aviv / / Person Uri Zwick / / / Position Lecturer / / PublishedMedium Journal of the ACM / / Technology Karger-Stein recursive contraction algorithm / min-cut algorithm / 2 The Stoer-Wagner algorithm / deterministic and randomized algorithms / celebrated max-flow min-cut algorithm / random contraction algorithm The Stoer-Wagner algorithm / recursive random contraction algorithm / network flow algorithm / random contraction algorithm / /
SocialTag |