Keywords
ranking
round-robin tournament
upset
digraph
MST
GIK
round-robin tournament
upset
digraph
MST
GIK
How to Cite
Raghad Rowaida, & Afsana Ahmed Munia. (2017). A New Ranking Algorithm for A Round-Robin Tournament. Global Journal of Computer Science and Technology, 17(G2), 31–33. Retrieved from https://gjcst.com/index.php/gjcst/article/view/684
Abstract
The problem of ranking players in a round- robin tournament in which outcome of any match is a win or a loss is to rank players according to their performances in the tournament In this paper we have improved previously developed MST Majority Spanning Tree algorithm for solving this problem where the number of violations has been chosen as the criterion of optimality We have compared the performance of our algorithm with the MST algorithm and GIK algorithm
This work is licensed under a Creative Commons Attribution 4.0 International License.
Copyright (c) 2017 Authors and Global Journals Private Limited