Geodesic
Computing Tournament Sequence Numbers Efficiently With Matrix Techniques
Séminaire lotharingien de combinatoire, Tome 47 (2001-2002) 
Erich Neuwirth. Computing Tournament Sequence Numbers Efficiently With Matrix Techniques. Séminaire lotharingien de combinatoire, Tome 47 (2001-2002). http://geodesic.mathdoc.fr/item/SLC_2001-2002_47_a7/
@article{SLC_2001-2002_47_a7,
     author = {Erich Neuwirth},
     title = {Computing {Tournament} {Sequence} {Numbers} {Efficiently} {With} {Matrix} {Techniques}},
     journal = {S\'eminaire lotharingien de combinatoire},
     year = {2001-2002},
     volume = {47},
     url = {http://geodesic.mathdoc.fr/item/SLC_2001-2002_47_a7/}
}
TY  - JOUR
AU  - Erich Neuwirth
TI  - Computing Tournament Sequence Numbers Efficiently With Matrix Techniques
JO  - Séminaire lotharingien de combinatoire
PY  - 2001-2002
VL  - 47
UR  - http://geodesic.mathdoc.fr/item/SLC_2001-2002_47_a7/
ID  - SLC_2001-2002_47_a7
ER  - 
%0 Journal Article
%A Erich Neuwirth
%T Computing Tournament Sequence Numbers Efficiently With Matrix Techniques
%J Séminaire lotharingien de combinatoire
%D 2001-2002
%V 47
%U http://geodesic.mathdoc.fr/item/SLC_2001-2002_47_a7/
%F SLC_2001-2002_47_a7

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

We give a new, "almost explicit" formula for tournament numbers, representing them as upper left elements of the n-th power of a matrix with an explicit formula for elements of the original matrix. Using this representation, we show how to compute tournament numbers in time complexity O(n6).