Théorème de BEST (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Théorème de BEST" in French language version.

refsWebsite

Global rank French rank

low place

9,268^th place

942^nd place

1,744^th place

1combinatorics.org

low place

low place

anu.edu.au

cs.anu.edu.au

(en) Brendan McKay et Robert W. Robinson, « Asymptotic enumeration of eulerian circuits in the complete graph », Combinatorica, vol. 10, n^o 4,‎ 1995, p. 367–377 (lire en ligne).

combinatorics.org

(en) Mikhail Isaev, « Asymptotic Behaviour of the Number of Eulerian Circuits », Electronic Journal of Combinatorics, vol. 18, n^o 1,‎ 2011 (lire en ligne).

siam.org

(en) Graham Brightwell et Peter Winkler, « Counting Eulerian Circuits is #P-Complete », dans C. Demetrescu, R. Sedgewick et R. Tamassia (éditeurs), ALENEX/ANALCO : Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, Vancouver, BC, Canada, SIAM, 2005 (ISBN 0-89871-596-2, lire en ligne), p. 259-262.