Sorting a sequence of strong kings in a tournament

DOI10.1016/S0020-0190(03)00346-6zbMath1175.68127OpenAlexW1967940287MaRDI QIDQ1014449

Ting-Yem Ho, Jou-Ming Chang

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00346-6

zbMATH Keywords

computational complexitytournamentsorting algorithmskingstrong king

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (1)

The existence and uniqueness of strong kings in tournaments

Cites Work

• A generalization of rotational tournaments
• An efficient sorting algorithm for a sequence of kings in a tournament.
• Unnamed Item

This page was built for publication: Sorting a sequence of strong kings in a tournament