随机算法 (Fall 2011)/Randomized 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.

4 September 2011

19 July 2011

  • curprev 02:3102:31, 19 July 2011‎ 114.212.208.2 talk‎ 7,210 bytes +7,210‎ Created page with 'Let <math>G(V, E)</math> be a graph. Suppose that we want to partition the vertex set <math>V</math> into two parts <math>S</math> and <math>T</math> such that the number of ''cr…'
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=随机算法_(Fall_2011)/Randomized_Min-Cut"