高级算法 (Fall 2018)/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.

10 September 2018

4 September 2018

3 September 2018

  • curprev 08:0408:04, 3 September 2018‎ imported>Etone‎ 44,272 bytes −28‎ No edit summary
  • curprev 08:0108:01, 3 September 2018‎ imported>Etone‎ 44,300 bytes −212‎ No edit summary
  • curprev 05:4405:44, 3 September 2018‎ imported>Etone‎ 44,512 bytes +44,512‎ 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_2018)/Min-Cut_and_Max-Cut"