Ford–Fulkerson algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Ford–Fulkerson algorithm" in English language version.

refsWebsite

Global rank English rank

6^th place

6^th place

2^nd place

2^nd place

565^th place

460^th place

1semanticscholar.org

11^th place

8^th place

207^th place

136^th place

archive.org

Laung-Terng Wang, Yao-Wen Chang, Kwang-Ting (Tim) Cheng (2009). Electronic Design Automation: Synthesis, Verification, and Test. Morgan Kaufmann. pp. 204. ISBN 978-0080922003.{{cite book}}: CS1 maint: multiple names: authors list (link)
Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein (2009). Introduction to Algorithms. MIT Press. pp. 714. ISBN 978-0262258104.

doi.org

Ford, L. R.; Fulkerson, D. R. (1956). "Maximal flow through a network" (PDF). Canadian Journal of Mathematics. 8: 399–404. doi:10.4153/CJM-1956-045-5. S2CID 16109790.
Zwick, Uri (21 August 1995). "The smallest networks on which the Ford–Fulkerson maximum flow procedure may fail to terminate". Theoretical Computer Science. 148 (1): 165–170. doi:10.1016/0304-3975(95)00022-O.

psu.edu

citeseerx.ist.psu.edu

"Ford-Fulkerson Max Flow Labeling Algorithm". 1998. CiteSeerX 10.1.1.295.9049.

semanticscholar.org

api.semanticscholar.org

Ford, L. R.; Fulkerson, D. R. (1956). "Maximal flow through a network" (PDF). Canadian Journal of Mathematics. 8: 399–404. doi:10.4153/CJM-1956-045-5. S2CID 16109790.

yale.edu

cs.yale.edu

Ford, L. R.; Fulkerson, D. R. (1956). "Maximal flow through a network" (PDF). Canadian Journal of Mathematics. 8: 399–404. doi:10.4153/CJM-1956-045-5. S2CID 16109790.