组合数学 (Fall 2011)/Flow and matching: 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.

17 August 2011

16 August 2011

  • curprev 08:2508:25, 16 August 2011‎ imported>WikiSysop‎ m 21,657 bytes 0‎ Protected "组合数学 (Fall 2011)/Flow and matching" ([edit=sysop] (indefinite) [move=sysop] (indefinite))
  • curprev 08:2508:25, 16 August 2011‎ imported>WikiSysop‎ 21,657 bytes +21,657‎ Created page with '== Flow and Cut== === Flows === An instance of the maximum flow problem consists of: * a directed graph <math>G(V,E)</math>; * two distinguished vertices <math>s</math> (the '''…'
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=组合数学_(Fall_2011)/Flow_and_matching"