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

DOI10.1016/0377-2217(95)00294-4zbMath0974.05502OpenAlexW2059856190MaRDI QIDQ1278398

Olivier Hudry, Irène Charon, Anne Germa

Publication date: 13 December 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00294-4

zbMATH Keywords

graph theorytournamentspolynomial algorithmrandom algorithmsasymmetric graphsout-degrees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Mathematical programming approaches for classes of random network problems ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments

Cites Work

• Score sequences: Lexicographic enumeration and tournament construction
• The median procedure in cluster analysis and social choice theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random generation of tournaments and asymmetric graphs with given out-degrees