Une heuristique pour le calcul de l'indice de transitivité d'un tournoi

J.-C. Bermond; Y. Kodratoff

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1976)

  • Volume: 10, Issue: R1, page 83-92
  • ISSN: 0988-3754

How to cite

top

Bermond, J.-C., and Kodratoff, Y.. "Une heuristique pour le calcul de l'indice de transitivité d'un tournoi." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 10.R1 (1976): 83-92. <http://eudml.org/doc/92030>.

@article{Bermond1976,
author = {Bermond, J.-C., Kodratoff, Y.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {fre},
number = {R1},
pages = {83-92},
publisher = {EDP-Sciences},
title = {Une heuristique pour le calcul de l'indice de transitivité d'un tournoi},
url = {http://eudml.org/doc/92030},
volume = {10},
year = {1976},
}

TY - JOUR
AU - Bermond, J.-C.
AU - Kodratoff, Y.
TI - Une heuristique pour le calcul de l'indice de transitivité d'un tournoi
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1976
PB - EDP-Sciences
VL - 10
IS - R1
SP - 83
EP - 92
LA - fre
UR - http://eudml.org/doc/92030
ER -

References

top
  1. 1. A. ASTIE. Communication personnelle, 1975. 
  2. 2. C. BERGE. Graphes et Hypergraphes, Dunod, Paris, 1970. Zbl0213.25702MR357173
  3. 3. J.-C. BERMOND. The Circuit Hypergraph of a Tournament, Infinite and finite sets. Proc. Coll. Math. Soc. Jänos Bolyai, Keszthely, Hongrie, 1973, North-Holland, Amsterdam, vol. I, 1975, p. 165-180. Zbl0302.05110MR396319
  4. 4. J.-C. BERMOND, Ordres à distance minimale d'un tournoi et graphes partiels sans circuits maximaux. Math. Sc. Humaines, vol. 37, 1972, p. 5-25 Zbl0239.05122MR300927
  5. 5. P. ERDÖS et J. W. MOON. On Sets of Consistent Arcs in a Tournament. Canad, Math. Bull., vol. 8, 1965, p. 269-271. Zbl0137.43301MR182574
  6. 6. J. HARDOUIN DU PARC. Math. Sc. Humaines, Vol. 51, 1975, p. 35-41. Zbl0319.05111MR396320
  7. 7. M. G. KENDALL. Rank Correlation Method, 3e ed., New York, Hafner, 1962. 
  8. 8. A. KOTZIG. On the Maximal Order of Cyclicity of Antisymetric Directed Graphs. Discrete Math., vol. 12, 1975, p. 17-25. Zbl0299.05107MR389652
  9. 9. J. W. MOON. Topics on Tournaments, Holt, New York, 1968. Zbl0191.22701MR256919
  10. 10. R. REMAGE et W. A. THOMPSON, Maximum Likelihood Paired Comparison Ranking. Biometrika, vol. 53, 1966, p. 143-149. Zbl0138.13207MR196854
  11. 11. B. ROY. Algèbre moderne et théorie des graphes, t. 2, Dunod, Paris, 1970. Zbl0238.90073MR260413
  12. 12. A. SACHE. La théorie des graphes. P.U.F. coll. Que sais-je ?, Paris, 1974. Zbl0294.05101
  13. 13. P. SLATER. Inconsistencies in a Schedule of Paired Comparisons. Biometrika, vol. 48, 1961, p. 303-312. 
  14. 14. C. THOMASSEN. Transversals of Circuits in the Lexicographic Product of Directed Graphs. Math. Sc. Humaines, vol. 51, 1975, p. 43-45. Zbl0315.05109MR392659
  15. 15. D. H. YOUNGER. Communication personnelle, 1975. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.