Max-flow min-cut theorem: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 19:2319:23, 12 February 2025 7804j talk contribs 24,773 bytes +646 Add example undo Tag: Visual edit

curprev 02:4702:47, 26 December 2024 Briandamgaard talk contribs m 24,127 bytes 0 →Network: Changed "a finite directed graph N = (V, E)" to "a finite directed graph G = (V, E)". Rationale: 1) the graph is not the network, and 2) the convention for a graph definition is "G = (V, E)". undo

curprev 12:1612:16, 29 October 2024 A3nm talk contribs 24,127 bytes +176 →Project selection problem: more precise phrasing of the problem undo Tag: 2017 wikitext editor

curprev 15:1415:14, 8 September 2024 Citation bot talk contribs 23,951 bytes +45 Altered pages. Add: doi, issue. Formatted dashes. | Use this bot. Report bugs. | Suggested by Abductive | Category:Network flow problem | #UCB_Category 19/20 undo

curprev 01:1101:11, 11 August 2024 EvanBaldonado talk contribs m 23,906 bytes +2 Replace hyphen with en-dash. undo

curprev 04:5604:56, 27 January 2024 AugPi talk contribs m 23,904 bytes +3 →Generalized max-flow min-cut theorem undo

curprev 19:3419:34, 28 December 2023 2601:483:4500:24a9:8c3e:fbb7:a20f:c209 talk 23,901 bytes +26 →Linear program formulation: Correction. The rest of the table makes it clear that when f_uv is positive, f_vu is zero. undo Tags: Mobile edit Mobile web edit

curprev 16:2216:22, 25 October 2023 Me, Myself, and I are Here talk contribs 23,875 bytes 0 →See also: alpha undo Tags: Mobile edit Mobile web edit Advanced mobile edit

curprev 20:0320:03, 16 June 2023 83.150.57.142 talk 23,875 bytes −4 →Menger's theorem: Remove definite article before proper name undo Tags: Mobile edit Mobile web edit

curprev 04:2504:25, 1 December 2022 Gu0427 talk contribs m 23,879 bytes −34 →Project selection problem undo Tag: Visual edit: Switched

curprev 17:0717:07, 11 July 2022 AxelBoldt talk contribs m 23,913 bytes −2 No edit summary undo
curprev 16:5616:56, 11 July 2022 AxelBoldt talk contribs 23,915 bytes +188 →Linear program formulation: dual explained undo Tag: Visual edit

curprev 06:0606:06, 2 April 2022 207.107.159.62 talk 23,727 bytes 0 →Network undo

curprev 17:4917:49, 17 March 2022 134.134.139.85 talk 23,727 bytes +1 No edit summary undo

curprev 20:1120:11, 3 February 2022 AxelBoldt talk contribs 23,478 bytes −129 →Example: a slightly more complicated example undo
curprev 19:0419:04, 3 February 2022 AxelBoldt talk contribs 23,607 bytes +91 mention finiteness of graph; moving example up undo Tag: Visual edit: Switched

curprev 05:1905:19, 9 November 2021 Headbomb talk contribs 23,516 bytes 0 ce undo

curprev 19:1619:16, 15 October 2021 128.252.48.8 talk 23,516 bytes 0 Fixed spelling error. undo

curprev 17:4217:42, 13 October 2021 Pgan002 talk contribs m 23,516 bytes −30 →top undo Tag: Visual edit

curprev 14:2314:23, 7 September 2021 2610:148:1f00:7000:9067:d89:8d8e:606f talk 23,546 bytes −1 →Cuts undo
curprev 14:2314:23, 7 September 2021 2610:148:1f00:7000:9067:d89:8d8e:606f talk 23,547 bytes +25 →Cuts undo

curprev 00:3300:33, 27 June 2021 Csytrn talk contribs m 23,522 bytes +19 →Project selection problem undo

curprev 21:3121:31, 26 June 2021 Csytrn talk contribs m 23,503 bytes 0 →Proof undo

curprev 14:4614:46, 10 May 2021 Tilpo talk contribs 23,503 bytes +8 →Linear program formulation undo

curprev 08:2708:27, 2 April 2021 2.202.59.42 talk 23,495 bytes +118 Replaced dead link http://www.dtic.mil/dtic/tr/fulltext/u2/605014.pdf with link to the Wayback Machine undo

curprev 11:0311:03, 26 January 2021 Huggums537 talk contribs m 23,377 bytes +53 Adding local short description: "Concept in optimization theory", overriding Wikidata description "theorem in optimization theory" (Shortdesc helper) undo

curprev 22:2622:26, 27 December 2020 Monkbot talk contribs m 23,324 bytes +2 Task 18 (cosmetic): eval 7 templates: hyphenate params (2×); undo Tag: AWB

curprev 18:2018:20, 1 December 2020 W576A925 talk contribs 23,322 bytes −24 →Flows: formatting revision undo
curprev 18:1618:16, 1 December 2020 W576A925 talk contribs m 23,346 bytes +79 →Flows: minor format revision undo

curprev 13:0513:05, 4 November 2020 Darcourse talk contribs 23,267 bytes +18 →Proof undo
curprev 13:0313:03, 4 November 2020 Darcourse talk contribs 23,249 bytes +136 →Proof undo

curprev 07:2807:28, 25 October 2020 Darcourse talk contribs 23,113 bytes +62 →Definitions and statement: clarification of statement undo

curprev 11:0211:02, 22 October 2020 Darcourse talk contribs m 23,051 bytes −5 →Proof: should be in own paragraph, and removed italics undo

curprev 19:5519:55, 30 September 2020 174.103.110.157 talk 23,056 bytes +23 →See also undo

curprev 22:2822:28, 21 September 2020 47.44.134.5 talk 23,033 bytes −3 No edit summary undo Tags: Mobile edit Mobile web edit

curprev 16:2116:21, 21 July 2020 2607:fea8:bda0:9b20:b955:fbd3:3105:5fb9 talk 23,036 bytes −146 minor formatting improvements undo

curprev 12:5412:54, 20 March 2020 2003:ec:b71c:9200:b9e8:c3b3:416e:c8b3 talk 23,182 bytes 0 corrected minor typo undo

curprev 17:5517:55, 5 February 2020 Materialscientist talk contribs m 23,182 bytes −16 Reverted 1 edit by 138.51.112.203 identified as test/vandalism using STiki undo Tags: Rollback STiki
curprev 17:4217:42, 5 February 2020 138.51.112.203 talk 23,198 bytes +16 content undo Tags: Mobile edit Mobile web edit

curprev 04:1904:19, 17 December 2019 Sbrozell0 talk contribs m 23,182 bytes −21 →Example: Corrected grammar. This example may need further clarification. undo

curprev 14:0314:03, 13 October 2019 Monkbot talk contribs m 23,203 bytes −130 →Linear program formulation: Task 16: replaced (0×) / removed (2×) deprecated |dead-url= and |deadurl= with |url-status=; undo Tag: AWB

curprev 01:5101:51, 3 October 2019 1.129.111.51 talk 23,333 bytes +1 →Project selection problem: grammar undo
curprev 01:4901:49, 3 October 2019 1.129.111.51 talk 23,332 bytes +606 →Example: Note that the flow through each of the dashed edges is at full capacity: this is the 'bottleneck' of the system. By contrast there is spare capacity in the right-hand part of the network. In particular, the flow from node one to node two need not be equal to 1. If there were no flow between nodes one and two, then the inputs to the sink would change to 4/4 and 3/5; the total flow would still be seven (4+3=7). On the other hand, if the flow from node one to node two were doubl undo
curprev 01:4201:42, 3 October 2019 1.129.111.51 talk 22,726 bytes +238 →Example: The numerical annotation on each arrow, in the form ''x''/''y'', indicate the actual flow (''x'') and the maximum flow capacity (''y''). The flows emanating from the source total seven (3+4=7), as do the flows into the sink (4+3=7). undo

12 February 2025

26 December 2024

29 October 2024

8 September 2024

11 August 2024

27 January 2024

28 December 2023

25 October 2023

16 June 2023

1 December 2022

11 July 2022

2 April 2022

17 March 2022

4 February 2022

3 February 2022

9 November 2021

15 October 2021

13 October 2021

7 September 2021

27 June 2021

26 June 2021

10 May 2021

2 April 2021

26 January 2021

27 December 2020

1 December 2020

4 November 2020

25 October 2020

22 October 2020

30 September 2020

21 September 2020

21 July 2020

20 March 2020

5 February 2020

17 December 2019

13 October 2019

3 October 2019