Sciweavers

JCT
2006
93views more  JCT 2006»
13 years 11 months ago
Dominating sets in k-majority tournaments
A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u v if and only if u lies above v in at least k of the orders. Motiva...
Noga Alon, Graham Brightwell, Hal A. Kierstead, Al...