Algorithme hongrois (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Algorithme hongrois" in French language version.

refsWebsite

Global rank French rank

1epfl.ch

4,521^st place

1,512^th place

1wikipedia.org

low place

1psu.edu

207^th place

929^th place

1st-andrews.ac.uk

1,547^th place

1,635^th place

1ucdavis.edu

1,873^rd place

2,511^th place

1unibo.it

4,963^rd place

3,934^th place

epfl.ch (Global: 4,521^st place; French: 1,512^th place)

theory.epfl.ch

(en) Ola Svensson (lecturer), Mateusz Golebiewski et Maciej Duleba (scribes), « Topics in Theoretical Computer Science, Lecture 5: Understanding and using Linear Programming », sur École polytechnique fédérale de Lausanne, mars 2015.

psu.edu (Global: 207^th place; French: 929^th place)

math.psu.edu

(en) « Harold W. Kuhn, in his celebrated paper entitled The Hungarian Method for the assignment problem, [Naval Research Logistic Quarterly, 2 (1955), pp. 83-97] described an algorithm for constructing a maximum weight perfect matching in a bipartite graph » dans András Frank (en), On Kuhn’s Hungarian Method – A tribute from Hungary

st-andrews.ac.uk (Global: 1,547^th place; French: 1,635^th place)

tom.host.cs.st-andrews.ac.uk

(en) Harold W. Kuhn, « The Hungarian Method for the Assignment Problem: Introduction by Harold W. Kuhn », sur Tom Kelsey à l'Université de St Andrews.

ucdavis.edu (Global: 1,873^rd place; French: 2,511^th place)

math.ucdavis.edu

(en) James Munkres, Algorithms for the assignment and transportation Problem.

unibo.it (Global: 4,963^rd place; French: 3,934^th place)

or.deis.unibo.it

(en) Silvano Martello, « Jenö Egerváry: from the origins of the Hungarian algorithm to satellite communication », Central European Journal of Operations Research, vol. 18, n^o 1,‎ 2010, p. 47-58 (lire en ligne).

wikipedia.org (Global: low place; French: low place)

en.wikipedia.org

(en) « Harold W. Kuhn, in his celebrated paper entitled The Hungarian Method for the assignment problem, [Naval Research Logistic Quarterly, 2 (1955), pp. 83-97] described an algorithm for constructing a maximum weight perfect matching in a bipartite graph » dans András Frank (en), On Kuhn’s Hungarian Method – A tribute from Hungary