An improved MST algorithm for ranking players of a round-robin tournament

DOI10.1080/00207160701332721zbMath1220.91011OpenAlexW1970794256MaRDI QIDQ5438689

Mohammad Kaykobad, Avijit Datta, Moazzem Hossain

Publication date: 28 January 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701332721

zbMATH Keywords

rankingdigraphround-robin tournamentupset

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Majority spanning trees, cotrees and their applications

Cites Work

• A new algorithm for ranking players of a round-robin tournament
• Ranking in Tournaments and Group Decisionmaking
• On the Minimum Violations Ranking of a Tournament
• Tournament Ranking with Expected Profit in Polynomial Time
• Constructive Quasi-Ramsey Numbers and Tournament Ranking

This page was built for publication: An improved MST algorithm for ranking players of a round-robin tournament