{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T17:56:17Z","timestamp":1695578177475},"reference-count":15,"publisher":"EDP Sciences","issue":"R1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["R.A.I.R.O. Informatique th\u00e9orique"],"published-print":{"date-parts":[[1976]]},"DOI":"10.1051\/ita\/197610r100831","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:38:00Z","timestamp":1486395480000},"page":"83-92","source":"Crossref","is-referenced-by-count":3,"title":["Une heuristique pour le calcul de l'indice de transitivit\u00e9 d'un tournoi"],"prefix":"10.1051","volume":"10","author":[{"given":"J.-C.","family":"Bermond","sequence":"first","affiliation":[]},{"given":"Y.","family":"Kodratoff","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. ASTIE A.. Communication personnelle, 1975."},{"key":"R2","unstructured":"2. BERGE C.. Graphes et Hypergraphes, Dunod, Paris, 1970.3571730213.25702"},{"key":"R3","unstructured":"3. BERMOND J.-C.. The Circuit Hypergraph of a Tournament, Infinite and finite sets. Proc. Coll. Math. Soc. J\u00e4nos Bolyai, Keszthely, Hongrie, 1973, North-Holland, Amsterdam, vol. I, 1975, p. 165-180.3963190302.05110"},{"key":"R4","unstructured":"4. BERMOND J.-C., Ordres \u00e0 distance minimale d'un tournoi et graphes partiels sans circuits maximaux. Math. Sc. Humaines, vol. 37, 1972, p. 5-25941043009270239.05122"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. ERD\u00d6S P. et MOON J. W.. On Sets of Consistent Arcs in a Tournament. Canad, Math. Bull., vol. 8, 1965, p. 269-271.1825740137.43301","DOI":"10.4153\/CMB-1965-017-1"},{"key":"R6","unstructured":"6. HARDOUIN DU PARC J.. Math. Sc. Humaines, Vol. 51, 1975, p. 35-41.941603963200319.05111"},{"key":"R7","unstructured":"7. KENDALL M. G.. Rank Correlation Method, 3e ed., New York, Hafner, 1962."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. KOTZIG A.. On the Maximal Order of Cyclicity of Antisymetric Directed Graphs. Discrete Math., vol. 12, 1975, p. 17-25.3896520299.05107","DOI":"10.1016\/0012-365X(75)90092-8"},{"key":"R9","unstructured":"9. MOON J. W.. Topics on Tournaments, Holt, New York, 1968.2569190191.22701"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. REMAGE R. et THOMPSON W. A., Maximum Likelihood Paired Comparison Ranking. Biometrika, vol. 53, 1966, p. 143-149.1968540138.13207","DOI":"10.1093\/biomet\/53.1-2.143"},{"key":"R11","unstructured":"11. ROY B.. Alg\u00e8bre moderne et th\u00e9orie des graphes, t. 2, Dunod, Paris, 1970.0238.90073260413"},{"key":"R12","unstructured":"12. SACHE A.. La th\u00e9orie des graphes. P.U.F. coll. Que sais-je ?, Paris, 1974.0294.05101"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. SLATER P.. Inconsistencies in a Schedule of Paired Comparisons. Biometrika, vol. 48, 1961, p. 303-312.","DOI":"10.1093\/biomet\/48.3-4.303"},{"key":"R14","unstructured":"14. THOMASSEN C.. Transversals of Circuits in the Lexicographic Product of Directed Graphs. Math. Sc. Humaines, vol. 51, 1975, p. 43-45.941613926590315.05109"},{"key":"R15","unstructured":"15. YOUNGER D. H.. Communication personnelle, 1975."}],"container-title":["Revue fran\u00e7aise d'automatique informatique recherche op\u00e9rationnelle. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/197610R100831\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:34:39Z","timestamp":1568799279000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/197610R100831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":15,"journal-issue":{"issue":"R1"},"alternative-id":["ita197610R100831"],"URL":"https:\/\/doi.org\/10.1051\/ita\/197610r100831","relation":{},"ISSN":["0397-9326"],"issn-type":[{"value":"0397-9326","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}