Hungarian algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hungarian algorithm" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

5^th place

5^th place

2cp-algorithms.com

low place

low place

1web.archive.org

1^st place

1^st place

1polytechnique.fr

low place

low place

1semanticscholar.org

11^th place

8^th place

low place

low place

cp-algorithms.com

Jacob Kogler (20 December 2022). "Minimum-cost flow - Successive shortest path algorithm". Algorithms for Competitive Programming. Retrieved 14 May 2023.
"Solving assignment problem using min-cost-flow". Algorithms for Competitive Programming. 17 July 2022. Retrieved 14 May 2023.

doi.org

Edmonds, Jack; Karp, Richard M. (1 April 1972). "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems". Journal of the ACM. 19 (2): 248–264. doi:10.1145/321694.321699. S2CID 6375478.
Tomizawa, N. (1971). "On some techniques useful for solution of transportation network problems". Networks. 1 (2): 173–194. doi:10.1002/net.3230010206. ISSN 1097-0037.
Flood, Merrill M. (1956). "The Traveling-Salesman Problem". Operations Research. 4 (1): 61–75. doi:10.1287/opre.4.1.61. ISSN 0030-364X.

e-maxx.ru

"Hungarian Algorithm for Solving the Assignment Problem". e-maxx :: algo. 23 August 2012. Retrieved 13 May 2023.

polytechnique.fr

lix.polytechnique.fr

"Presentation". Archived from the original on 16 October 2015.

semanticscholar.org

api.semanticscholar.org

Edmonds, Jack; Karp, Richard M. (1 April 1972). "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems". Journal of the ACM. 19 (2): 248–264. doi:10.1145/321694.321699. S2CID 6375478.

web.archive.org

"Presentation". Archived from the original on 16 October 2015.

worldcat.org

search.worldcat.org

Tomizawa, N. (1971). "On some techniques useful for solution of transportation network problems". Networks. 1 (2): 173–194. doi:10.1002/net.3230010206. ISSN 1097-0037.
Flood, Merrill M. (1956). "The Traveling-Salesman Problem". Operations Research. 4 (1): 61–75. doi:10.1287/opre.4.1.61. ISSN 0030-364X.