高级算法 (Fall 2017)/Min-Cut and Max-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.

15 September 2017

12 September 2017

  • curprev 09:0509:05, 12 September 2017‎ imported>Etone‎ 44,511 bytes +44,511‎ Created page with "= Graph Cut = Let <math>G(V, E)</math> be an undirected graph. A subset <math>C\subseteq E</math> of edges is a '''cut''' of graph <math>G</math> if <math>G</math> becomes ''d..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=高级算法_(Fall_2017)/Min-Cut_and_Max-Cut"