46
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

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

, &
Pages 1-7 | Received 04 Apr 2005, Accepted 10 Mar 2007, Published online: 31 Dec 2007
 

The problem of ranking players in a round-robin tournament, in which the outcome of any match is a win or a loss, is to rank them according to their performances in the tournament. In this paper we have improved the previously developed majority spanning tree (MST) algorithm for solving this problem, where the number of violations has been chosen as the criterion of optimality. The performance of our algorithm is compared with that of the MST algorithm.

Acknowledgements

The authors wish to thank the anonymous referees for their valuable comments.

Additional information

Notes on contributors

Moazzem Hossain

Email: [email protected]

M. Kaykobad

Email: [email protected]

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.