组合数学 (Spring 2014)/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.

11 June 2014

  • curprev 05:1205:12, 11 June 2014‎ imported>Etone‎ 30,979 bytes +30,979‎ 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=组合数学_(Spring_2014)/Flow_and_matching"