德爾伯特·雷·富爾克森 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "德爾伯特·雷·富爾克森" in Chinese language version.

refsWebsite

Global rank Chinese rank

5web.archive.org

1^st place

2doi.org

2^nd place

23^rd place

2archive.org

6^th place

4^th place

1maa.org

3,479^th place

4,890^th place

1jstor.org

26^th place

113^th place

1cornell.edu

332^nd place

526^th place

1yale.edu

565^th place

664^th place

1ams.org

451^st place

935^th place

1semanticscholar.org

11^th place

332^nd place

1grips.ac.jp

low place

1informs.org

low 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） .

archive.org

L. R. Ford; D. R. Fulkerson. Flows in Networks. Princeton, NJ: Princeton University Press. 1962. ISBN 9780691079622.
Hoffman, Paul, The Man Who Loved Only Numbers: The Story of Paul Erdős and the Search for Mathematical Truth, Hyperion: 109–110, 1998, ISBN 978-0-7868-6362-4 .

cornell.edu

ecommons.library.cornell.edu

Delbert Ray Fulkerson (PDF). library.cornell.edu. [2014-07-01]. （原始内容存档 (PDF)于2013-12-06）.

doi.org

Fulkerson, D. R. Flow networks and combinatorial operations research (PDF). Amer. Math. Monthly. 1966, 73 (2): 115–138 [2023-03-25]. JSTOR 2313544. doi:10.2307/2313544. （原始内容存档 (PDF)于2023-03-25）.
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） .

grips.ac.jp

OYAMA, Tatsuo | GRIPS Faculty Directory. [2023-03-25]. （原始内容存档于2022-08-18）.

informs.org

D. Ray Fulkerson （页面存档备份，存于互联网档案馆） from informs.org

jstor.org

Fulkerson, D. R. Flow networks and combinatorial operations research (PDF). Amer. Math. Monthly. 1966, 73 (2): 115–138 [2023-03-25]. JSTOR 2313544. doi:10.2307/2313544. （原始内容存档 (PDF)于2023-03-25）.

maa.org

Fulkerson, D. R. Flow networks and combinatorial operations research (PDF). Amer. Math. Monthly. 1966, 73 (2): 115–138 [2023-03-25]. JSTOR 2313544. doi:10.2307/2313544. （原始内容存档 (PDF)于2023-03-25）.

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） .

web.archive.org

Fulkerson, D. R. Flow networks and combinatorial operations research (PDF). Amer. Math. Monthly. 1966, 73 (2): 115–138 [2023-03-25]. JSTOR 2313544. doi:10.2307/2313544. （原始内容存档 (PDF)于2023-03-25）.
Delbert Ray Fulkerson (PDF). library.cornell.edu. [2014-07-01]. （原始内容存档 (PDF)于2013-12-06）.
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） .
OYAMA, Tatsuo | GRIPS Faculty Directory. [2023-03-25]. （原始内容存档于2022-08-18）.
D. Ray Fulkerson （页面存档备份，存于互联网档案馆） from informs.org

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） .