Parallel matching for ranking all teams in a tournament
Keyword(s):
We propose a simple and efficient scheme for ranking all teams in a tournament where matches can be played simultaneously. We show that the distribution of the number of rounds of the proposed scheme can be derived using lattice path counting techniques used in ballot problems. We also discuss our method from the viewpoint of parallel sorting algorithms.
Keyword(s):
2016 ◽
Vol 53
(1)
◽
pp. 106-120
◽
1979 ◽
1993 ◽
Vol 14
(1)
◽
pp. 43-51
◽
1994 ◽
Vol 68
(1)
◽
pp. 215-217
1980 ◽
Vol 143
(4)
◽
pp. 524
2009 ◽
Vol 46
(02)
◽
pp. 507-520
◽
2018 ◽
Vol 21
(4)
◽
pp. 1119-1149
◽
Keyword(s):