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

DOI10.1080/00207160701332721MaRDI QIDQ5438689zbMATH OpenOpenAlexFDO

Authors Avijit Datta, Moazzem Hossain, Mohammad Kaykobad

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

digraphrankinground-robin tournamentupset

Mathematics Subject Classification ID

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

Recommendations

• A new algorithm for ranking players of a round-robin tournament
• Comparing the efficacy of ranking methods for multiple round-robin tournaments
• Construction de rankings dans un tournoi
• Tournament Ranking with Expected Profit in Polynomial Time
• Ranking players in multiple tournaments

Cites work

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

Cited in

(4)

• A new algorithm for ranking players of a round-robin tournament
• Comparing the efficacy of ranking methods for multiple round-robin tournaments
• On partial sorting in restricted rounds
• Majority spanning trees, cotrees and their applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5438689)