Article Fingerprint
ReserarchID
XBK39
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.
Raghad Rowaida. 2017. \u201cA New Ranking Algorithm for A Round-Robin Tournament\u201d. Global Journal of Computer Science and Technology - G: Interdisciplinary GJCST-G Volume 17 (GJCST Volume 17 Issue G2): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 102
Country: Bangladesh
Subject: Global Journal of Computer Science and Technology - G: Interdisciplinary
Authors: Raghad Rowaida, Afsana Ahmed Munia (PhD/Dr. count: 0)
View Count (all-time): 287
Total Views (Real + Logic): 6254
Total Downloads (simulated): 1550
Publish Date: 2017 11, Mon
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
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.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.