COMBINATORICS
2000
13 years 4 months ago
2000
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
DM
2007
13 years 4 months ago
2007
Arrow’s impossibility theorem [1] shows that the set of acyclic tournaments is not closed to non dictatorial Boolean aggregation. In this paper we extend the notion of aggregati...
GC
2006
Springer
13 years 5 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
AICOM
2007
13 years 5 months ago
2007
Abstract. Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial natur...