迪尼茨算法 (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

1^st place

low place

low place

low place

low place

5^th place

12^th place

2^nd place

23^rd place

bgu.ac.il

cs.bgu.ac.il

Yefim Dinitz. Algorithm for solution of a problem of maximum flow in a network with power estimation (PDF). Doklady Akademii nauk SSSR. 1970, 11: 1277–1280 [2016-08-04]. （原始内容存档 (PDF)于2016-08-22）.
Yefim Dinitz. Dinitz's Algorithm: The Original Version and Even's Version (PDF). [2016-08-04]. （原始内容存档 (PDF)于2016-08-20）.

doi.org

Even, Shimon; Tarjan, R. Endre. Network Flow and Testing Graph Connectivity. SIAM Journal on Computing. 1975, 4 (4): 507–518. ISSN 0097-5397. doi:10.1137/0204043.

powershow.com

Ilan Kadar; Sivan Albagli. Dinitz's algorithm for finding a maximum flow in a network. 2009-11-27 [2016-08-04]. （原始内容存档于2016-06-24）.

web.archive.org

Yefim Dinitz. Algorithm for solution of a problem of maximum flow in a network with power estimation (PDF). Doklady Akademii nauk SSSR. 1970, 11: 1277–1280 [2016-08-04]. （原始内容存档 (PDF)于2016-08-22）.
Ilan Kadar; Sivan Albagli. Dinitz's algorithm for finding a maximum flow in a network. 2009-11-27 [2016-08-04]. （原始内容存档于2016-06-24）.
Yefim Dinitz. Dinitz's Algorithm: The Original Version and Even's Version (PDF). [2016-08-04]. （原始内容存档 (PDF)于2016-08-20）.

worldcat.org

Even, Shimon; Tarjan, R. Endre. Network Flow and Testing Graph Connectivity. SIAM Journal on Computing. 1975, 4 (4): 507–518. ISSN 0097-5397. doi:10.1137/0204043.