Maximum flow problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Maximum flow problem" in English language version.

Last modified: 10:37:46, 21 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2925doi.org

2^nd place

1212ams.org

434^th place

249^th place

107semanticscholar.org

15^th place

8^th place

87arxiv.org

49^th place

31^st place

63psu.edu

299^th place

159^th place

54web.archive.org

1^st place

33adsabs.harvard.edu

14^th place

9^th place

22quantamagazine.org

6,258^th place

4,046^th place

22hdl.handle.net

66^th place

34^th place

22worldcat.org

4^th place

21dtic.mil

934^th place

530^th place

22mit.edu

476^th place

340^th place

11berkeley.edu

621^st place

429^th place

11rutgers.edu

2,011^th place

1,139^th place

11utas.edu.au

7,828^th place

4,558^th place

11tau.ac.il

3,866^th place

3,877^th place

11acm.org

1,200^th place

821^st place

11jstor.org

23^rd place

15^th place

11cmu.edu

2,125^th place

1,347^th place

11gitlab.com

low place

11pearson.com

low place

acm.org (Global: 1,200^th place; English: 821^st place)

dl.acm.org

King, Valerie; Rao, S.; Tarjan, Robert Endre (1992). "A faster deterministic maximum flow algorithm". In Frederickson, Greg N. (ed.). Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA. pp. 157–164.

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Brand, Jan Van Den; Chen, Li; Kyng, Rasmus; Liu, Yang P.; Peng, Richard; Gutenberg, Maximilian Probst; Sachdeva, Sushant; Sidford, Aaron (November 2023). "A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). pp. 503–514. Bibcode:2023focs.conf...38B. doi:10.1109/FOCS57990.2023.00037. ISBN 979-8-3503-1894-4.
Brand, Jan Van Den; Chen, Li; Kyng, Rasmus; Liu, Yang P.; Peng, Richard; Gutenberg, Maximilian Probst; Sachdeva, Sushant; Sidford, Aaron (November 2023). "A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). pp. 503–514. Bibcode:2023focs.conf...38B. doi:10.1109/FOCS57990.2023.00037. ISBN 979-8-3503-1894-4.
Schwartz, B. L. (1966). "Possible Winners in Partially Completed Tournaments". SIAM Review. 8 (3): 302–308. Bibcode:1966SIAMR...8..302S. doi:10.1137/1008062. JSTOR 2028206.

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Edmonds, Jack; Karp, Richard M. (April 1972). "Theoretical improvements in algorithmic efficiency for network flow problems". Journal of the ACM. 19 (2): 248–264. doi:10.1145/321694.321699. Previously announced at the International Conference on Combinatorial Structures and their Applications, Calgary, Alberta, 1969, MR 0266680.
Dinic, E. A. (1970). "An algorithm for the solution of the problem of maximal flow in a network with power estimation". Doklady Akademii Nauk SSSR. 194: 754–757. MR 0287976.
Karzanov, A. V. (1974). "The problem of finding the maximal flow in a network by the method of preflows". Doklady Akademii Nauk SSSR. 215: 49–52. MR 0343879.
Čerkasskiĭ, B. V. (1977). "An algorithm for the construction of the maximal flow in a network with a labor expenditure of $O(n^{2}{\sqrt {p}})$ actions". Mathematical Methods for the Solution of Economic Problems. 7: 117–126. MR 0503654.
Galil, Zvi (1980). "An $O(V^{5/3}E^{2/3})$ algorithm for the maximal flow problem". Acta Informatica. 14 (3): 221–242. doi:10.1007/BF00264254. MR 0587133. Preliminary version, "A new algorithm for the maximal flow problem", 19th Annual Symposium on Foundations of Computer Science (FOCS), 1978.
Sleator, Daniel D.; Tarjan, Robert Endre (1983). "A data structure for dynamic trees". Journal of Computer and System Sciences. 26 (3): 362–391. doi:10.1016/0022-0000(83)90006-5. MR 0710253. Preliminary version, 13th ACM Symposium on Theory of Computing (STOC), 1981, doi:10.1145/800076.802464
Cheriyan, Joseph; Hagerup, Torben (1995). "A randomized maximum-flow algorithm". SIAM Journal on Computing. 24 (2): 203–226. doi:10.1137/S0097539791221529. MR 1320205. Preliminary version in 30th Annual Symposium on Foundations of Computer Science (FOCS), 1989, doi:10.1109/SFCS.1989.63465
Alon, Noga (1990). "Generating pseudo-random permutations and maximum flow algorithms" (PDF). Information Processing Letters. 35 (4): 201–204. doi:10.1016/0020-0190(90)90024-R. MR 1066123. Cited as a 1989 manuscript by Cheriyan, Hagerup, and Mehlhorn 1990.
Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt (1996). "An $o(n^{3})$ -time maximum-flow algorithm". SIAM Journal on Computing. 25 (6): 1144–1170. doi:10.1137/S0097539791278376. hdl:11858/00-001M-0000-0014-B08A-3. MR 1417893. Preliminary version, "Can a maximum flow be computed in $o(nm)$ time?", 17th International Colloquium on Automata, Languages and Programming (ICALP), 1990, doi:10.1007/BFb0032035
King, V.; Rao, S.; Tarjan, R. (1994). "A faster deterministic maximum flow algorithm". Journal of Algorithms. 17 (3): 447–474. doi:10.1006/jagm.1994.1044. MR 1300259.
Orlin, James B.; Gong, Xiao-yue (2021). "A fast maximum flow algorithm". Networks. 77 (2): 287–321. doi:10.1002/net.22001. hdl:1721.1/134021. MR 4264487.
Ford, L. R. Jr.; Fulkerson, D. R. (1956). "Maximal flow through a network". Canadian Journal of Mathematics. 8: 399–404. doi:10.4153/CJM-1956-045-5. MR 0079251.

arxiv.org (Global: 49^th place; English: 31^st place)

Sherman, Jonah (2013). "Nearly Maximum Flows in Nearly Linear Time". Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science. pp. 263–269. arXiv:1304.2077. doi:10.1109/FOCS.2013.36. ISBN 978-0-7695-5135-7. S2CID 14681906.
Kelner, J. A.; Lee, Y. T.; Orecchia, L.; Sidford, A. (2014). "An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations" (PDF). Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. p. 217. arXiv:1304.2338. doi:10.1137/1.9781611973402.16. ISBN 978-1-61197-338-9. S2CID 10733914. Archived from the original (PDF) on 3 March 2016.
Chen, L.; Kyng, R.; Liu, Y.P.; Gutenberg, M.P.; Sachdeva, S. (2022). "Maximum Flow and Minimum-Cost Flow in Almost-Linear Time". arXiv:2203.00671 [cs.DS].
Bernstein, Aaron; Nanongkai, Danupon; Wulff-Nilsen, Christian (30 October 2022). "Negative-Weight Single-Source Shortest Paths in Near-linear Time". arXiv:2203.03456 [cs.DS].
Brand, J. vd; Lee, Y.T.; Liu, Y.P.; Saranurak, T.; Sidford, A; Song, Z.; Wang, D. (2021). "Minimum Cost Flows, MDPs, and ℓ1-Regression in Nearly Linear Time for Dense Instances". arXiv:2101.05719 [cs.DS].
Gao, Y.; Liu, Y.P.; Peng, R. (2021). "Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao". arXiv:2101.07233 [cs.DS].
Bernstein, A.; Blikstad, J.; Saranurak, T.; Tu, T. (2024). "Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time". arXiv:2406.03648 [cs.DS].

berkeley.edu (Global: 621^st place; English: 429^th place)

focs2022.eecs.berkeley.edu

"FOCS 2022". focs2022.eecs.berkeley.edu. Retrieved 25 January 2023.

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

cs.cmu.edu

Carl Kingsford. "Max-flow extensions: circulations with demands" (PDF).

doi.org (Global: 2^nd place; English: 2^nd place)

Schrijver, A. (2002). "On the history of the transportation and maximum flow problems". Mathematical Programming. 91 (3): 437–445. CiteSeerX 10.1.1.23.5134. doi:10.1007/s101070100259. S2CID 10210675. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Gass, Saul I.; Assad, Arjang A. (2005). "Mathematical, algorithmic and professional developments of operations research from 1951 to 1956". An Annotated Timeline of Operations Research. International Series in Operations Research & Management Science. Vol. 75. pp. 79–110. doi:10.1007/0-387-25837-X_5 (inactive 19 July 2026). ISBN 978-1-4020-8116-3.{{cite book}}: CS1 maint: DOI inactive as of July 2026 (link)
Ford, L. R.; Fulkerson, D. R. (1956). "Maximal flow through a network". Canadian Journal of Mathematics. 8: 399–404. doi:10.4153/CJM-1956-045-5.
Sherman, Jonah (2013). "Nearly Maximum Flows in Nearly Linear Time". Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science. pp. 263–269. arXiv:1304.2077. doi:10.1109/FOCS.2013.36. ISBN 978-0-7695-5135-7. S2CID 14681906.
Kelner, J. A.; Lee, Y. T.; Orecchia, L.; Sidford, A. (2014). "An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations" (PDF). Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. p. 217. arXiv:1304.2338. doi:10.1137/1.9781611973402.16. ISBN 978-1-61197-338-9. S2CID 10733914. Archived from the original (PDF) on 3 March 2016.
Orlin, James B. (2013). "Max flows in O(nm) time, or better". Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. pp. 765–774. CiteSeerX 10.1.1.259.5759. doi:10.1145/2488608.2488705. ISBN 9781450320290. S2CID 207205207. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Brand, Jan Van Den; Chen, Li; Kyng, Rasmus; Liu, Yang P.; Peng, Richard; Gutenberg, Maximilian Probst; Sachdeva, Sushant; Sidford, Aaron (November 2023). "A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). pp. 503–514. Bibcode:2023focs.conf...38B. doi:10.1109/FOCS57990.2023.00037. ISBN 979-8-3503-1894-4.
Edmonds, Jack; Karp, Richard M. (April 1972). "Theoretical improvements in algorithmic efficiency for network flow problems". Journal of the ACM. 19 (2): 248–264. doi:10.1145/321694.321699. Previously announced at the International Conference on Combinatorial Structures and their Applications, Calgary, Alberta, 1969, MR 0266680.
Malhotra, V.M.; Kumar, M. Pramodh; Maheshwari, S.N. (1978). "An $O(|V|^{3})$ algorithm for finding maximum flows in networks" (PDF). Information Processing Letters. 7 (6): 277–278. doi:10.1016/0020-0190(78)90016-9.
Galil, Zvi (1980). "An $O(V^{5/3}E^{2/3})$ algorithm for the maximal flow problem". Acta Informatica. 14 (3): 221–242. doi:10.1007/BF00264254. MR 0587133. Preliminary version, "A new algorithm for the maximal flow problem", 19th Annual Symposium on Foundations of Computer Science (FOCS), 1978.
Galil, Zvi; Naamad, Amnon (1980). "An $O{\bigl (}EV(\log V)^{2}{\bigr )}$ algorithm for the maximal flow problem". Journal of Computer and System Sciences. 21 (2): 203–217. doi:10.1016/0022-0000(80)90035-5. Circulated as an unpublished manuscript in 1978, and published in preliminary form as "Network flow and generalized path compression", 20th Annual Symposium on Foundations of Computer Science (FOCS), 1979, doi:10.1145/800135.804394.
Sleator, Daniel D.; Tarjan, Robert Endre (1983). "A data structure for dynamic trees". Journal of Computer and System Sciences. 26 (3): 362–391. doi:10.1016/0022-0000(83)90006-5. MR 0710253. Preliminary version, 13th ACM Symposium on Theory of Computing (STOC), 1981, doi:10.1145/800076.802464
Goldberg, A. V.; Tarjan, R. E. (1988). "A new approach to the maximum-flow problem". Journal of the ACM. 35 (4): 921. doi:10.1145/48014.61051. S2CID 52152408. Preliminary version, 18th Annual ACM Symposium on Theory of Computing (STOC), 1986, doi:10.1145/12130.12144
Cheriyan, Joseph; Hagerup, Torben (1995). "A randomized maximum-flow algorithm". SIAM Journal on Computing. 24 (2): 203–226. doi:10.1137/S0097539791221529. MR 1320205. Preliminary version in 30th Annual Symposium on Foundations of Computer Science (FOCS), 1989, doi:10.1109/SFCS.1989.63465
Alon, Noga (1990). "Generating pseudo-random permutations and maximum flow algorithms" (PDF). Information Processing Letters. 35 (4): 201–204. doi:10.1016/0020-0190(90)90024-R. MR 1066123. Cited as a 1989 manuscript by Cheriyan, Hagerup, and Mehlhorn 1990.
Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt (1996). "An $o(n^{3})$ -time maximum-flow algorithm". SIAM Journal on Computing. 25 (6): 1144–1170. doi:10.1137/S0097539791278376. hdl:11858/00-001M-0000-0014-B08A-3. MR 1417893. Preliminary version, "Can a maximum flow be computed in $o(nm)$ time?", 17th International Colloquium on Automata, Languages and Programming (ICALP), 1990, doi:10.1007/BFb0032035
Phillips, Steven J.; Westbrook, Jeffery R. (1998). "On-line load balancing and network flow". Algorithmica. 21 (3): 245–261. doi:10.1007/PL00009214. Preliminary version, 25th ACM Symposium on Theory of Computing (STOC), 1993, doi:10.1145/167088.167201.
King, V.; Rao, S.; Tarjan, R. (1994). "A faster deterministic maximum flow algorithm". Journal of Algorithms. 17 (3): 447–474. doi:10.1006/jagm.1994.1044. MR 1300259.
Orlin, James B.; Gong, Xiao-yue (2021). "A fast maximum flow algorithm". Networks. 77 (2): 287–321. doi:10.1002/net.22001. hdl:1721.1/134021. MR 4264487.
Ford, L. R. Jr.; Fulkerson, D. R. (1956). "Maximal flow through a network". Canadian Journal of Mathematics. 8: 399–404. doi:10.4153/CJM-1956-045-5. MR 0079251.
Goldberg, A. V.; Rao, S. (1998). "Beyond the flow decomposition barrier". Journal of the ACM. 45 (5): 783. doi:10.1145/290179.290181. S2CID 96030.
Brand, Jan Van Den; Chen, Li; Kyng, Rasmus; Liu, Yang P.; Peng, Richard; Gutenberg, Maximilian Probst; Sachdeva, Sushant; Sidford, Aaron (November 2023). "A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). pp. 503–514. Bibcode:2023focs.conf...38B. doi:10.1109/FOCS57990.2023.00037. ISBN 979-8-3503-1894-4.
Itai, A.; Perl, Y.; Shiloach, Y. (1982). "The complexity of finding maximum disjoint paths with length constraints". Networks. 12 (3): 277–286. doi:10.1002/net.3230120306. ISSN 1097-0037.
Schwartz, B. L. (1966). "Possible Winners in Partially Completed Tournaments". SIAM Review. 8 (3): 302–308. Bibcode:1966SIAMR...8..302S. doi:10.1137/1008062. JSTOR 2028206.
Schauer, Joachim; Pferschy, Ulrich (1 July 2013). "The maximum flow problem with disjunctive constraints". Journal of Combinatorial Optimization. 26 (1): 109–119. CiteSeerX 10.1.1.414.4496. doi:10.1007/s10878-011-9438-7. ISSN 1382-6905. S2CID 6598669. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

dtic.mil (Global: 934^th place; English: 530^th place)

Harris, T. E.; Ross, F. S. (1955). "Fundamentals of a Method for Evaluating Rail Net Capacities" (PDF). Research Memorandum. Archived from the original (PDF) on 8 January 2014.

gitlab.com (Global: low place; English: low place)

"Project imagesegmentationwithmaxflow, that contains the source code to produce these illustrations". GitLab. Archived from the original on 22 December 2019. Retrieved 22 December 2019.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt (1996). "An $o(n^{3})$ -time maximum-flow algorithm". SIAM Journal on Computing. 25 (6): 1144–1170. doi:10.1137/S0097539791278376. hdl:11858/00-001M-0000-0014-B08A-3. MR 1417893. Preliminary version, "Can a maximum flow be computed in $o(nm)$ time?", 17th International Colloquium on Automata, Languages and Programming (ICALP), 1990, doi:10.1007/BFb0032035
Orlin, James B.; Gong, Xiao-yue (2021). "A fast maximum flow algorithm". Networks. 77 (2): 287–321. doi:10.1002/net.22001. hdl:1721.1/134021. MR 4264487.

jstor.org (Global: 23^rd place; English: 15^th place)

Schwartz, B. L. (1966). "Possible Winners in Partially Completed Tournaments". SIAM Review. 8 (3): 302–308. Bibcode:1966SIAMR...8..302S. doi:10.1137/1008062. JSTOR 2028206.

mit.edu (Global: 476^th place; English: 340^th place)

math.mit.edu

Kelner, J. A.; Lee, Y. T.; Orecchia, L.; Sidford, A. (2014). "An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations" (PDF). Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. p. 217. arXiv:1304.2338. doi:10.1137/1.9781611973402.16. ISBN 978-1-61197-338-9. S2CID 10733914. Archived from the original (PDF) on 3 March 2016.

web.mit.edu

Knight, Helen (7 January 2014). "New algorithm can dramatically streamline solutions to the 'max flow' problem". MIT News. Archived from the original on 26 February 2014. Retrieved 8 January 2014.

pearson.com (Global: low place; English: low place)

"Algorithm Design". pearson.com. Retrieved 21 December 2019.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Schrijver, A. (2002). "On the history of the transportation and maximum flow problems". Mathematical Programming. 91 (3): 437–445. CiteSeerX 10.1.1.23.5134. doi:10.1007/s101070100259. S2CID 10210675. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Orlin, James B. (2013). "Max flows in O(nm) time, or better". Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. pp. 765–774. CiteSeerX 10.1.1.259.5759. doi:10.1145/2488608.2488705. ISBN 9781450320290. S2CID 207205207. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Schauer, Joachim; Pferschy, Ulrich (1 July 2013). "The maximum flow problem with disjunctive constraints". Journal of Combinatorial Optimization. 26 (1): 109–119. CiteSeerX 10.1.1.414.4496. doi:10.1007/s10878-011-9438-7. ISSN 1382-6905. S2CID 6598669. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

quantamagazine.org (Global: 6,258^th place; English: 4,046^th place)

Klarreich, Erica (8 June 2022). "Researchers Achieve 'Absurdly Fast' Algorithm for Network Flow". Quanta Magazine. Retrieved 8 June 2022.
Brubaker, Ben (18 January 2023). "Finally, a Fast Algorithm for Shortest Paths on Negative Graphs". Quanta Magazine. Retrieved 25 January 2023.

rutgers.edu (Global: 2,011^th place; English: 1,139^th place)

cs.rutgers.edu

Santosh, Nagarakatte. "FOCS 2022 Best Paper Award for Prof. Aaron Bernstein's Paper". www.cs.rutgers.edu. Retrieved 25 January 2023.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Schrijver, A. (2002). "On the history of the transportation and maximum flow problems". Mathematical Programming. 91 (3): 437–445. CiteSeerX 10.1.1.23.5134. doi:10.1007/s101070100259. S2CID 10210675. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Sherman, Jonah (2013). "Nearly Maximum Flows in Nearly Linear Time". Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science. pp. 263–269. arXiv:1304.2077. doi:10.1109/FOCS.2013.36. ISBN 978-0-7695-5135-7. S2CID 14681906.
Kelner, J. A.; Lee, Y. T.; Orecchia, L.; Sidford, A. (2014). "An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations" (PDF). Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. p. 217. arXiv:1304.2338. doi:10.1137/1.9781611973402.16. ISBN 978-1-61197-338-9. S2CID 10733914. Archived from the original (PDF) on 3 March 2016.
Orlin, James B. (2013). "Max flows in O(nm) time, or better". Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. pp. 765–774. CiteSeerX 10.1.1.259.5759. doi:10.1145/2488608.2488705. ISBN 9781450320290. S2CID 207205207. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Goldberg, A. V.; Tarjan, R. E. (1988). "A new approach to the maximum-flow problem". Journal of the ACM. 35 (4): 921. doi:10.1145/48014.61051. S2CID 52152408. Preliminary version, 18th Annual ACM Symposium on Theory of Computing (STOC), 1986, doi:10.1145/12130.12144
Goldberg, A. V.; Rao, S. (1998). "Beyond the flow decomposition barrier". Journal of the ACM. 45 (5): 783. doi:10.1145/290179.290181. S2CID 96030.
Schauer, Joachim; Pferschy, Ulrich (1 July 2013). "The maximum flow problem with disjunctive constraints". Journal of Combinatorial Optimization. 26 (1): 109–119. CiteSeerX 10.1.1.414.4496. doi:10.1007/s10878-011-9438-7. ISSN 1382-6905. S2CID 6598669. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

tau.ac.il (Global: 3,866^th place; English: 3,877^th place)

cs.tau.ac.il

Alon, Noga (1990). "Generating pseudo-random permutations and maximum flow algorithms" (PDF). Information Processing Letters. 35 (4): 201–204. doi:10.1016/0020-0190(90)90024-R. MR 1066123. Cited as a 1989 manuscript by Cheriyan, Hagerup, and Mehlhorn 1990.

utas.edu.au (Global: 7,828^th place; English: 4,558^th place)

eprints.utas.edu.au

Malhotra, V.M.; Kumar, M. Pramodh; Maheshwari, S.N. (1978). "An $O(|V|^{3})$ algorithm for finding maximum flows in networks" (PDF). Information Processing Letters. 7 (6): 277–278. doi:10.1016/0020-0190(78)90016-9.

web.archive.org (Global: 1^st place; English: 1^st place)

Harris, T. E.; Ross, F. S. (1955). "Fundamentals of a Method for Evaluating Rail Net Capacities" (PDF). Research Memorandum. Archived from the original (PDF) on 8 January 2014.
Kelner, J. A.; Lee, Y. T.; Orecchia, L.; Sidford, A. (2014). "An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations" (PDF). Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. p. 217. arXiv:1304.2338. doi:10.1137/1.9781611973402.16. ISBN 978-1-61197-338-9. S2CID 10733914. Archived from the original (PDF) on 3 March 2016.
Knight, Helen (7 January 2014). "New algorithm can dramatically streamline solutions to the 'max flow' problem". MIT News. Archived from the original on 26 February 2014. Retrieved 8 January 2014.
"Project imagesegmentationwithmaxflow, that contains the source code to produce these illustrations". GitLab. Archived from the original on 22 December 2019. Retrieved 22 December 2019.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Itai, A.; Perl, Y.; Shiloach, Y. (1982). "The complexity of finding maximum disjoint paths with length constraints". Networks. 12 (3): 277–286. doi:10.1002/net.3230120306. ISSN 1097-0037.
Schauer, Joachim; Pferschy, Ulrich (1 July 2013). "The maximum flow problem with disjunctive constraints". Journal of Combinatorial Optimization. 26 (1): 109–119. CiteSeerX 10.1.1.414.4496. doi:10.1007/s10878-011-9438-7. ISSN 1382-6905. S2CID 6598669. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

Maximum flow problem (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)

dl.acm.org

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

arxiv.org (Global: 49th place; English: 31st place)

berkeley.edu (Global: 621st place; English: 429th place)

focs2022.eecs.berkeley.edu

cmu.edu (Global: 2,125th place; English: 1,347th place)

cs.cmu.edu

doi.org (Global: 2nd place; English: 2nd place)

dtic.mil (Global: 934th place; English: 530th place)