Maximális áramlási probléma (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Maximális áramlási probléma" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

13doi.org

2^nd place

8^th place

2web.archive.org

1^st place

2archive.org

6^th place

14^th place

2worldcat.org

5^th place

22^nd place

2mit.edu

415^th place

753^rd place

1dtic.mil

833^rd place

2,645^th place

1utas.edu.au

9,835^th place

low place

1cmu.edu

1,564^th place

4,669^th place

1gitlab.com

low place

1pearson.com

low place

archive.org

Ford (1956). „Maximal flow through a network”. Canadian Journal of Mathematics 8, 399–404. o. DOI:10.4153/CJM-1956-045-5.
Itai (1982). „The complexity of finding maximum disjoint paths with length constraints” (angol nyelven). Networks 12 (3), 277–286. o. DOI:10.1002/net.3230120306. ISSN 1097-0037.

cmu.edu

cs.cmu.edu

Carl Kingsford: Max-flow extensions: circulations with demands

doi.org

dx.doi.org

Schrijver (2002). „On the history of the transportation and maximum flow problems”. Mathematical Programming 91 (3), 437–445. o. DOI:10.1007/s101070100259.
Gass, Saul I.. 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, 79–110. o.. DOI: 10.1007/0-387-25837-X_5 (2005). ISBN 978-1-4020-8116-3
Ford (1956). „Maximal flow through a network”. Canadian Journal of Mathematics 8, 399–404. o. DOI:10.4153/CJM-1956-045-5.
Sherman, Jonah. Nearly Maximum Flows in Nearly Linear Time, Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 263–269. o.. DOI: 10.1109/FOCS.2013.36 (2013). ISBN 978-0-7695-5135-7
Kelner, J. A.. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 217. o.. DOI: 10.1137/1.9781611973402.16 (2014). ISBN 978-1-61197-338-9
Orlin, James B.. Max flows in O(nm) time, or better, 765–774. o.. DOI: 10.1145/2488608.2488705 (2013). ISBN 9781450320290
Malhotra (1978). „An $O(|V|^{3})$ algorithm for finding maximum flows in networks”. Information Processing Letters 7 (6), 277–278. o. DOI:10.1016/0020-0190(78)90016-9.
King (1994). „A Faster Deterministic Maximum Flow Algorithm”. Journal of Algorithms 17 (3), 447–474. o. DOI:10.1006/jagm.1994.1044.
Goldberg (1998). „Beyond the flow decomposition barrier”. Journal of the ACM 45 (5), 783. o. DOI:10.1145/290179.290181.
Goldberg (1988). „A new approach to the maximum-flow problem”. Journal of the ACM 35 (4), 921. o. DOI:10.1145/48014.61051.
Itai (1982). „The complexity of finding maximum disjoint paths with length constraints” (angol nyelven). Networks 12 (3), 277–286. o. DOI:10.1002/net.3230120306. ISSN 1097-0037.
Schwartz (1966). „Possible Winners in Partially Completed Tournaments”. SIAM Review 8 (3), 302–308. o. DOI:10.1137/1008062.
Schauer (2013. július 1.). „The maximum flow problem with disjunctive constraints” (angol nyelven). Journal of Combinatorial Optimization 26 (1), 109–119. o. DOI:10.1007/s10878-011-9438-7. ISSN 1382-6905.

dtic.mil

Harris (1955). „Fundamentals of a Method for Evaluating Rail Net Capacities”. Research Memorandum. [2017. február 17-i dátummal az eredetiből archiválva]. (Hozzáférés: 2020. május 20.)

gitlab.com

Project imagesegmentationwithmaxflow, that contains the source code to produce these illustrations. (angol nyelven). GitLab. (Hozzáférés: 2019. december 22.)

mit.edu

math.mit.edu

Kelner, J. A.. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 217. o.. DOI: 10.1137/1.9781611973402.16 (2014). ISBN 978-1-61197-338-9

web.mit.edu

Knight: New algorithm can dramatically streamline solutions to the 'max flow' problem. MIT News, 2014. január 7. [2014. február 26-i dátummal az eredetiből archiválva]. (Hozzáférés: 2014. január 8.)

pearson.com

Algorithm Design (angol nyelven). www.pearson.com. (Hozzáférés: 2019. december 21.)

utas.edu.au

eprints.utas.edu.au

Malhotra (1978). „An $O(|V|^{3})$ algorithm for finding maximum flows in networks”. Information Processing Letters 7 (6), 277–278. o. DOI:10.1016/0020-0190(78)90016-9.

web.archive.org

Harris (1955). „Fundamentals of a Method for Evaluating Rail Net Capacities”. Research Memorandum. [2017. február 17-i dátummal az eredetiből archiválva]. (Hozzáférés: 2020. május 20.)
Knight: New algorithm can dramatically streamline solutions to the 'max flow' problem. MIT News, 2014. január 7. [2014. február 26-i dátummal az eredetiből archiválva]. (Hozzáférés: 2014. január 8.)

worldcat.org

Itai (1982). „The complexity of finding maximum disjoint paths with length constraints” (angol nyelven). Networks 12 (3), 277–286. o. DOI:10.1002/net.3230120306. ISSN 1097-0037.
Schauer (2013. július 1.). „The maximum flow problem with disjunctive constraints” (angol nyelven). Journal of Combinatorial Optimization 26 (1), 109–119. o. DOI:10.1007/s10878-011-9438-7. ISSN 1382-6905.