Maximum flow problem: 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 18:0818:08, 27 October 2024 100.14.74.136 talk 43,270 bytes +1 →History: typo in book title undo

curprev 07:0907:09, 8 October 2024 MrAlgorithms talk contribs m 43,269 bytes +1,067 →Algorithms undo

curprev 15:0815:08, 8 September 2024 Citation bot talk contribs 42,202 bytes −81 Removed URL that duplicated identifier. Removed parameters. | Use this bot. Report bugs. | Suggested by Abductive | Category:Network flow problem | #UCB_Category 4/20 undo

curprev 18:5918:59, 10 January 2024 95.165.149.179 talk 42,283 bytes +2 forgot the linear factor in the complexity undo
curprev 18:4918:49, 10 January 2024 95.165.149.179 talk 42,281 bytes −1 minor fix undo
curprev 18:4818:48, 10 January 2024 95.165.149.179 talk 42,282 bytes +128 Current best complexity is not suitable for comparison with future faster algorithms at all. Somebody, confirm my refinement of the complexity, please undo

curprev 19:1019:10, 28 December 2023 2601:483:4500:24a9:9150:981e:1861:64ee talk 42,154 bytes +20 →Definition: correction to the mathematical expression of the conservation of flows. The text was already correct and now the equation mirrors it. undo

curprev 00:5300:53, 3 December 2023 TheMakcym talk contribs 42,134 bytes 0 Fixed typo in the formula of the value of flow ("-" substituted with "=") undo

curprev 05:3405:34, 1 December 2023 Xchippy talk contribs m 42,134 bytes −2 Ford-Fulkerson is widely known to be implementable in O(EU) time. undo

curprev 01:5401:54, 27 November 2023 ShlomoWeinstein talk contribs m 42,136 bytes +1 corrected typo undo Tag: Visual edit

curprev 21:1021:10, 17 November 2023 95.165.149.179 talk 42,135 bytes +121 →Algorithms undo

curprev 21:0621:06, 8 November 2023 Darcourse talk contribs m 42,014 bytes 0 →Definition: t is used for the sink undo

curprev 17:1817:18, 7 November 2023 OAbot talk contribs m 42,014 bytes +20 Open access bot: doi updated in citation with #oabot. undo

curprev 22:4922:49, 18 August 2023 OAbot talk contribs m 41,994 bytes +21 Open access bot: doi updated in citation with #oabot. undo

curprev 06:5006:50, 8 August 2023 Headbomb talk contribs m 41,973 bytes −13 →Algorithms: clean up undo Tag: AWB
curprev 03:0203:02, 8 August 2023 Citation bot talk contribs 41,986 bytes −101 Alter: title. Add: date. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox3 | #UCB_webform_linked 1258/2306 undo

curprev 19:1619:16, 13 April 2023 Maxal talk contribs 42,087 bytes +34 →Definition: corrected total flow value undo Tag: 2017 wikitext editor

curprev 06:3306:33, 1 March 2023 2401:fa00:8f:201:b5e5:30ee:9390:f22f talk 42,053 bytes +1 →Algorithms: Ope, <math>f</math> is bounded by <math>EU<math>. I wasn't considering duplicate edges. undo
curprev 06:2106:21, 1 March 2023 2401:fa00:8f:201:b5e5:30ee:9390:f22f talk 42,052 bytes −1 →Algorithms: The Ford-Fulkerson algorithm's time complexity is <math>O(Ef)</math> where <math>f</math> is the maximum flow of the network. <math>f</math> is bounded by <math>VU</math>, so the time complexity is <math>O(VEU)</math>, not <math>O(EU)</math>. Source: Ford-Fulkerson algo: <ref>https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm#cite_note-4</ref> undo

curprev 02:1702:17, 14 February 2023 Headbomb talk contribs 42,053 bytes −25 Add: eprint, class. Removed parameters. Some additions/deletions were parameter name changes. | Use this tool. Report bugs. | #UCB_Gadget undo
curprev 02:1302:13, 14 February 2023 Headbomb talk contribs 42,078 bytes −15 Alter: title. Add: arxiv, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this tool. Report bugs. | #UCB_Gadget undo

curprev 10:4610:46, 10 February 2023 Winnegar talk contribs 42,093 bytes −151 →Algorithms: Define the meaning of U above the table and replace fmax by U in the FF algo. undo

curprev 19:4419:44, 29 January 2023 OAbot talk contribs m 42,244 bytes +20 Open access bot: doi added to citation with #oabot. undo

curprev 21:1221:12, 26 January 2023 Palindromesemordnilap talk contribs m 42,224 bytes +2 →Definition: added "a" undo Tag: 2017 wikitext editor

curprev 03:3503:35, 25 January 2023 Dabed talk contribs 42,222 bytes −1 →History: some corrections undo Tag: Visual edit
curprev 03:2903:29, 25 January 2023 Dabed talk contribs 42,223 bytes +1,384 →History: +"For the single-source shortest path (SSSP) problem with negative weights a particular case of maximum flow problems another simpler algorithm in almost-linear time has been reported. Both algorithms were deemed best papers at the 2022 Symposium on Foundations of Computer Science" +4 ref undo Tag: Visual edit
curprev 03:2203:22, 25 January 2023 Dabed talk contribs 40,839 bytes +123 →History: +"for the minimum-cost flow problem of which for the maximum flow problem is a particular case" undo Tag: Visual edit

curprev 15:1115:11, 18 December 2022 90.183.96.234 talk 40,716 bytes +114 →Minimum path cover in directed acyclic graph: fix typo; improve phrasing undo

curprev 05:1905:19, 4 August 2022 Headbomb talk contribs m 40,602 bytes −7 clean up, replaced: Forty-f → Forty-F undo Tag: AWB

curprev 06:0906:09, 11 June 2022 Jarble talk contribs m 40,609 bytes +23 →Image segmentation: linking undo

curprev 20:4320:43, 8 June 2022 132.62.172.114 talk 40,586 bytes 0 →History: typo undo
curprev 15:4215:42, 8 June 2022 Dabed talk contribs 40,586 bytes +314 →History: Added next to the paper about the latest almost linear time max-flow min-cost algorithm an article covering it from Quanta Magazine undo Tag: Visual edit

curprev 11:5711:57, 7 June 2022 116.88.170.196 talk 40,272 bytes +7 →Algorithms: Fixed the complexity of the almost linear algorithm. undo

curprev 18:2918:29, 1 June 2022 GreenC bot talk contribs 40,265 bytes +159 Rescued 1 archive link. Wayback Medic 2.5 undo
curprev 08:2108:21, 1 June 2022 Leijurv talk contribs 40,106 bytes −25 →Algorithms: citation can and should be found in linked article undo

curprev 14:3614:36, 15 May 2022 Ohconfucius talk contribs 40,131 bytes +4 Script-assisted style fixes and per CS1 undo

curprev 06:5706:57, 16 April 2022 Lettherebedarklight talk contribs 40,127 bytes +60 Importing Wikidata short description: "Computational problem in graph theory" (Shortdesc helper) undo

curprev 21:0721:07, 14 April 2022 Pasthec talk contribs 40,067 bytes +216 →History undo
curprev 21:0421:04, 14 April 2022 Pasthec talk contribs 39,851 bytes +21 →Algorithms undo
curprev 21:0021:00, 14 April 2022 Pasthec talk contribs 39,830 bytes +737 Added latest almost linear time max-flow min-cost algorithm. undo

curprev 19:5219:52, 25 September 2021 96.20.200.195 talk 39,093 bytes +12 →Image segmentation: Correcting the value of $q(A,B)$ undo

curprev 05:5505:55, 10 September 2021 Cedar101 talk contribs m 39,081 bytes +31 →Airline scheduling: {{math}} undo
curprev 05:5405:54, 10 September 2021 Cedar101 talk contribs m 39,050 bytes +242 →Baseball elimination: fix math italics undo

curprev 14:2314:23, 17 August 2021 188.120.176.75 talk 38,808 bytes +125 →Maximum cardinality bipartite matching: Spell out how to find the matching from the flow. undo
curprev 14:1914:19, 17 August 2021 188.120.176.75 talk 38,683 bytes +395 →Integral flow theorem: Providing the proper explanation. undo
curprev 14:0914:09, 17 August 2021 188.120.176.75 talk 38,288 bytes −153 →Integral flow theorem: Restoring to revision oldid=1029255383; later versions miss the point undo Tag: Manual revert

curprev 20:5120:51, 18 June 2021 84.245.120.107 talk 38,441 bytes −7 →Integral flow theorem: rephrase more logically undo Tag: Reverted
curprev 20:5020:50, 18 June 2021 84.245.120.107 talk 38,448 bytes +95 →Integral flow theorem: elaborate undo Tag: Reverted
curprev 20:4720:47, 18 June 2021 84.245.120.107 talk 38,353 bytes +65 →Integral flow theorem: reason why is it so undo Tag: Reverted
curprev 20:4220:42, 18 June 2021 84.245.120.107 talk 38,288 bytes 0 →Algorithms: the survey in Goldberg-Tarjan is not so much more extensive anymore undo

27 October 2024

8 October 2024

8 September 2024

10 January 2024

28 December 2023

3 December 2023

1 December 2023

27 November 2023

17 November 2023

8 November 2023

7 November 2023

18 August 2023

8 August 2023

13 April 2023

1 March 2023

14 February 2023

10 February 2023

29 January 2023

26 January 2023

25 January 2023

18 December 2022

4 August 2022

11 June 2022

8 June 2022

7 June 2022

1 June 2022

15 May 2022

16 April 2022

14 April 2022

25 September 2021

10 September 2021

17 August 2021

18 June 2021