New results on the computation of median orders

Discrete Mathematics

Volumn 165-166, Issue , 1997, Pages 139-153

  Charon, I ^a   Guenoche A ^b   Hudry, O ^a   Woirgard, F ^a  

^a TELECOM PARISTECH   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041760397     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00166-5     Document Type: Article

References (19)

1. J.S. Banks, G. Bordes and M. Le Breton, Covering relations, closest orderings and Hamiltonian bypaths in tournaments, Soc. Choice Welfare 8 (1991) 355-363.
2. J.-P. Barthélemy, A. Guénoche and O. Hudry, Median linear orders: heuristics and a branch and bound algorithm, Eur. J. Oper. Res. 41 (1989) 313-325.
3. J.-P. Barthélemy, O. Hudry, G. Isaak, F.S. Roberts and B. Tesman, The reversing number of a digraph, Discrete Appl. Math. 60 (1995) 39-76.
4. J.-P. Barthélemy and B. Monjardet, The median procedure in cluster analysis and social choice theory, Math. Soc. Sci. 1 (1981) 235-267.
5. C. Berge, Hypergraphes (Gauthiers-Villars, Paris, 1987).
6. J.-C. Bermond, Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux, Math. Sci. Humaines 37 (1972) 5-25.
7. I. Charon, A. Germa and O. Hudry, Encadrement de l'indice de Slater d'un tournoi à l'aide de ses scores, Math. Inform. Sci. Humaines 118 (1992) 53-68.
8. G. Chartrand, D. Geller and S. Hedetniemi, Graphs with forbidden subgraphs, J. Combin. Theory 10, Ser. B (1971) 12-41.
9. A. Guénoche, How to choose according to partial evaluations, in: B. Bouchon-Meunier et al., eds, Advances in Intelligent Computing, IPMU'94, Lecture Notes in Computer Science, vol. 945 (Springer, Berlin, 1995) 611-618.
10. A. Guénoche, B. Vandeputte-Riboud and J.-B. Denis, Selecting varieties using a series of trials and a combinatorial ordering method, Agronomie 14 (1994) 363-375.
11. L. Hubert, Seriation using asymmetric proximity measures, Br. J. Math. Statist. Psychol. 29 (1976) 32-52.
12. M. Jünger, Polyhedral combinatorics and the acyclic subdigraph problem (Heldermann, Berlin, 1985).
13. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W Thatcher, eds, Complexity of Computer Computations (Plenum Press, New York, 1972) 85-103.
14. H.G. Landau, On dominance relations and the structure of animal societies III. The condition for a score structure, Bull. Math. Biophys. 13 (1953) 1-19.
15. B. Monjardet, Tournois et ordres médians pour une opinion, Math. Sci. Humaines 43 (1973) 55-70.
16. B. Monjardet, Sur diverses formes de la 'règle de Condorcet' d'agrégation des préférences, Math. Sci. Humaines 111 (1990) 61-71.
17. J.W. Moon, Topics on Tournaments (Holt, Rinehart and Winston, New York, 1968).
18. R. Remage Jr. and W.A. Thompson Jr., Maximum likelihood paired comparison rankings, Biometrika 53 (1966) 143-149.
19. P. Slater, Inconsistencies in a schedule of paired comparisons, Biometrika 48 (1961) 303-312.