随机算法 (Fall 2015)/Min-cut: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

9 October 2015

  • curprev 02:1102:11, 9 October 2015‎ imported>Etone‎ 14,389 bytes +14,389‎ Created page with "= Min-Cut in a Graph = Let <math>G(V, E)</math> be a multi-graph, which allows parallel edges between two distinct vertices <math>u</math> and <math>v</math> but does not allow a…"
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=随机算法_(Fall_2015)/Min-cut"