The Strong Kings of Tournaments
博士 === 國立臺灣科技大學 === 資訊管理系 === 96 === Abstract A tournament Tn is a complete oriented simple graph with n vertices, in which every pair of vertices is joined by exactly one arc. If the arc joining vertices x and y is directed from x to y, then x is said to dominate y and is denoted by x → y. The scor...
Main Authors: | An-Hang Chen, 陳恩航 |
---|---|
Other Authors: | Yue-Li Wang |
Format: | Others |
Language: | en_US |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/87070173320073028372 |
Similar Items
-
Testing for and selecting strong players in a tournament
by: Humphries, Dick
Published: (2011) -
Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
by: Meng Wei
Published: (2021-02-01) -
Dynamic tournaments with uncertain length: applicability of the tournament model in promotional tournaments.
Published: (1997) -
The Windsor Tournament
by: Marcus, John Michael
Published: (1975) -
On scores in tournaments
by: Naikoo T. A.
Published: (2018-12-01)