Minimum cut (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Minimum cut" in English language version.

refsWebsite

Global rank English rank

1^st place

2^nd place

11^th place

8^th place

2,242^nd place

1,513^th place

low place

9,066^th place

dartmouth.edu

Goldschmidt, Olivier; Hochbaum, Dorit S. (1994). "A Polynomial Algorithm for the k-cut Problem for Fixed k". Mathematics of Operations Research. 19: 24–37. doi:10.1287/moor.19.1.24.
Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; Yannakakis, M. (1994). "The Complexity of Multiterminal Cuts" (PDF). SIAM Journal on Computing. 23 (4): 864–894. doi:10.1137/S0097539792225297. S2CID 1123876. Archived from the original (PDF) on 2018-12-25.

Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; Yannakakis, M. (1994). "The Complexity of Multiterminal Cuts" (PDF). SIAM Journal on Computing. 23 (4): 864–894. doi:10.1137/S0097539792225297. S2CID 1123876. Archived from the original (PDF) on 2018-12-25.

Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; Yannakakis, M. (1994). "The Complexity of Multiterminal Cuts" (PDF). SIAM Journal on Computing. 23 (4): 864–894. doi:10.1137/S0097539792225297. S2CID 1123876. Archived from the original (PDF) on 2018-12-25.

"4 Min-Cut Algorithms". Archived from the original on 2016-08-05.
Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; Yannakakis, M. (1994). "The Complexity of Multiterminal Cuts" (PDF). SIAM Journal on Computing. 23 (4): 864–894. doi:10.1137/S0097539792225297. S2CID 1123876. Archived from the original (PDF) on 2018-12-25.