𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Searching for Sorted Sequences of Kings in Tournaments

✍ Scribed by Shen, Jian; Sheng, Li; Wu, Jie

Book ID
118181190
Publisher
Society for Industrial and Applied Mathematics
Year
2003
Tongue
English
Weight
148 KB
Volume
32
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sorting a sequence of strong kings in a
Sorting a sequence of strong kings in a tournament
✍ Ting-Yem Ho; Jou-Ming Chang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 79 KB

A king in a tournament is a player who beats any other player directly or indirectly. According to the existence of a king in every tournament, Wu and Sheng [Inform. Process. Lett. 79 (2001) 297-299] recently presented an algorithm for finding a sorted sequence of kings in a tournament of size n, i.

Number of 4-kings in bipartite tournamen
Number of 4-kings in bipartite tournaments with no 3-kings
✍ K.M. Koh; B.P. Tan πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 433 KB

We show that in any bipartite tournament with no transmitters and no 3-kings, the number of 4-kings is at least eight. All such bipartite tournaments having exactly eight 4-kings are completely characterized.

Tight Bounds for Searching a Sorted Arra
Tight Bounds for Searching a Sorted Array of Strings
✍ Andersson, Arne; Hagerup, Torben; HΓ₯stad, Johan; Petersson, Ola πŸ“‚ Article πŸ“… 2000 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 272 KB