An algorithm to generate tournament score sequences

DOI10.1016/S0895-7177(03)00013-XzbMath1023.05066OpenAlexW2092582992MaRDI QIDQ1410980

Rohan Hemasinha

Publication date: 15 October 2003

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(03)00013-x

zbMATH Keywords

algorithmtournamentscore sequenceHavel-Hakimi criterion

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Determining the results of tournament games using complete graphs generation ⋮ Tournament scoring problem ⋮ Score calculation from final tournament tables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the asymptotic number of tournament score sequences
• On a problem of Yuzvinsky on separating the n-cube
• Score sequences: Lexicographic enumeration and tournament construction
• An algorithm for generating partitions and its applications
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Computation of the Number of Score Sequences in Round-Robin Tournaments

This page was built for publication: An algorithm to generate tournament score sequences