Construction of All Tournaments with The Minimum Number of Upsets
碩士 === 國立臺灣科技大學 === 資訊管理系 === 101 === In a tournament, there are n players v_1, v_2, ..., v_n such that each pair of distinct players v_i and v_j is joined in only one game and no game is permitted to end in a tie. The score of v_i, denoted by s_i, is the total number of games that v_i wins. The sco...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/83505520359549324935 |