Sorting a sequence of strong kings in a tournament
References (5)
- et al.
A generalization of rotational tournaments
Discrete Math.
(1989) - et al.
An efficient sorting algorithm for a sequence of kings in a tournament
Inform. Process. Lett.
(2001)
There are more references available in the full text version of this article.
Cited by (3)
The existence and uniqueness of strong kings in tournaments
2008, Discrete MathematicsGraph theory: Undergraduate mathematics
2015, Graph Theory: Undergraduate Mathematics
Copyright © 2003 Elsevier B.V. All rights reserved.