Random generation of tournaments and asymmetric graphs with given out-degrees

European Journal of Operational Research

Volumn 95, Issue 2, 1996, Pages 411-419

  Charon, Irène ^a   Germa, Anne ^a   Hudry, Olivier ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Asymmetric graphs; Graph theory; Out degrees; Random algorithms; Tournaments

Indexed keywords

ALGORITHMS; NUMBER THEORY; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES;

ASYMMETRIC GRAPHS; OUT DEGREES; RANDOM ALGORITHMS; TOURNAMENTS;

GRAPH THEORY;

EID: 0030572952     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00294-4     Document Type: Article

References (10)

1. Barthélemy, J.-P., and Monjardet, B., "The median procedure in cluster analysis and social choice theory", Mathematical Social Sciences 1 (1981), 235-267.
2. Berge, C., Graphs, North-Holland, Amsterdam, 1985.
3. Caritat, M.J.A.N., marquis de Condorcet, Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix, Paris, 1785.
4. Garey, M.R., and Johnson, D.S., Computers and intractability, a guide to the theory of NP-completeness, Freeman, New York, 1979.
5. Gervacio, S.V., "Score sequences: lexicographic enumeration and tournament construction", Discrete Mathematics 72 (1988), 151-155.
6. Hudry, O., "Optimisation combinatoire en analyse de données ordinales", PhD thesis, ENST, Paris, 1989.
7. Landau, H.G., "On dominance relations and the structure of animal societies III. The condition for a score structure", Bulletin of Mathematical Biophysics 13 (1953), 1-19.
8. Moon, J.W., Topics on tournaments, Holt, New York, 1968.
9. Reid, K.B., and Beineke, L.W., "Tournaments", in: L.W. Beineke and R.J. Wilson (eds), Selected topics in graph theory, Academic Press, 1978, 169-204.
10. Ryser, H.J., "Matrices of zeros and ones in combinatorial mathematics", in Recent Advances in Matrix Theory, University of Wisconsin Press, Madison, 1964, 103-124.