小萊斯特·倫道夫·福特 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "小萊斯特·倫道夫·福特" in Chinese language version.

refsWebsite

Global rank Chinese rank

3web.archive.org

1^st place

2ams.org

451^st place

935^th place

2doi.org

2^nd place

23^rd place

2archive.org

6^th place

4^th place

1st-andrews.ac.uk

1,547^th place

1,388^th place

1yale.edu

565^th place

664^th place

1semanticscholar.org

11^th place

332^nd place

1rand.org

2,921^st place

3,782^nd place

1books.google.com

3^rd place

8^th place

1hathitrust.org

441^st place

1,550^th place

1noozhawk.com

low place

1archive.today

14^th place

18^th place

ams.org

Ford, L. R. Jr.; Fulkerson, D. R., Maximal flow through a network (PDF), Canadian Journal of Mathematics, 1956, 8: 399–404 [2023-03-25], MR 0079251, S2CID 16109790, doi:10.4153/cjm-1956-045-5, （原始内容存档 (PDF)于2019-07-13） .
Bellman, Richard. On a routing problem. Quarterly of Applied Mathematics. 1958, 16: 87–90. MR 0102435. doi:10.1090/qam/102435 .

archive.org

L. R. Ford; D. R. Fulkerson. Flows in Networks. Princeton University Press. 1962. ISBN 9780691079622.
Bellman, Richard. On a routing problem. Quarterly of Applied Mathematics. 1958, 16: 87–90. MR 0102435. doi:10.1090/qam/102435 .

archive.today

Lester R. Ford Jr. of Santa Barbara, 1927-2017. noozhawk.com. [17 March 2019]. （原始内容存档于2017-05-16）.

books.google.com

Mahmoud, Hosam M., 12.3.1 The Ford–Johnson algorithm, Sorting: A Distribution Theory, Wiley Series in Discrete Mathematics and Optimization 54, John Wiley & Sons: 286–288, 2011, ISBN 9781118031131

doi.org

Ford, L. R. Jr.; Fulkerson, D. R., Maximal flow through a network (PDF), Canadian Journal of Mathematics, 1956, 8: 399–404 [2023-03-25], MR 0079251, S2CID 16109790, doi:10.4153/cjm-1956-045-5, （原始内容存档 (PDF)于2019-07-13） .
Bellman, Richard. On a routing problem. Quarterly of Applied Mathematics. 1958, 16: 87–90. MR 0102435. doi:10.1090/qam/102435 .

hathitrust.org

babel.hathitrust.org

Lester Ford Sr. & Jr. (1963) Calculus （页面存档备份，存于互联网档案馆）, McGraw-Hill via HathiTrust.

noozhawk.com

Lester R. Ford Jr. of Santa Barbara, 1927-2017. noozhawk.com. [17 March 2019]. （原始内容存档于2017-05-16）.

rand.org

Ford, Lester R. Jr. Network Flow Theory. Paper P-923. Santa Monica, California: RAND Corporation. August 14, 1956 [2023-03-25]. （原始内容存档于2023-03-26）.

semanticscholar.org

api.semanticscholar.org

Ford, L. R. Jr.; Fulkerson, D. R., Maximal flow through a network (PDF), Canadian Journal of Mathematics, 1956, 8: 399–404 [2023-03-25], MR 0079251, S2CID 16109790, doi:10.4153/cjm-1956-045-5, （原始内容存档 (PDF)于2019-07-13） .

st-andrews.ac.uk

www-history.mcs.st-andrews.ac.uk

約翰·J·奧康納; 埃德蒙·F·羅伯遜, Lester Randolph Ford, MacTutor数学史档案（英语）

web.archive.org

Ford, L. R. Jr.; Fulkerson, D. R., Maximal flow through a network (PDF), Canadian Journal of Mathematics, 1956, 8: 399–404 [2023-03-25], MR 0079251, S2CID 16109790, doi:10.4153/cjm-1956-045-5, （原始内容存档 (PDF)于2019-07-13） .
Ford, Lester R. Jr. Network Flow Theory. Paper P-923. Santa Monica, California: RAND Corporation. August 14, 1956 [2023-03-25]. （原始内容存档于2023-03-26）.
Lester Ford Sr. & Jr. (1963) Calculus （页面存档备份，存于互联网档案馆）, McGraw-Hill via HathiTrust.

yale.edu

cs.yale.edu

Ford, L. R. Jr.; Fulkerson, D. R., Maximal flow through a network (PDF), Canadian Journal of Mathematics, 1956, 8: 399–404 [2023-03-25], MR 0079251, S2CID 16109790, doi:10.4153/cjm-1956-045-5, （原始内容存档 (PDF)于2019-07-13） .