搜索结果: 1-1 共查到“统筹论 tournaments”相关记录1条 . 查询时间(0.081 秒)
Reconstruction of complete interval tournaments. II
score sequences tournaments efficiency of algorithms
font style='font-size:12px;'>
2011/2/23
Let a, b (b ≥ a) and n (n ≥ 2) be nonnegative integers and let T (a, b, n) be the set of such generalised tournaments, in which every pair of distinct players is connected at most with b, and at least...