Sorting a sequence of strong kings in a tournament

DOI10.1016/S0020-0190(03)00346-6MaRDI QIDQ1014449zbMATH OpenOpenAlexFDO

Authors 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 complexitykingsorting algorithmsstrong kingtournament

Mathematics Subject Classification ID

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

Recommendations

• Searching for Sorted Sequences of Kings in Tournaments
• An efficient sorting algorithm for a sequence of kings in a tournament.
• Kings in \(k\)-partite tournaments
• The existence and uniqueness of strong kings in tournaments
• Finding kings in tournaments
• scientific article; zbMATH DE number 4025468
• Kings in multipartite tournaments
• Kings in multipartite tournaments and hypertournaments
• Common kings of a chain of cycles in a strong tournament
• scientific article; zbMATH DE number 759635

Cites work

• A generalization of rotational tournaments
• An efficient sorting algorithm for a sequence of kings in a tournament.
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)

Cited in

(3)

• An efficient sorting algorithm for a sequence of kings in a tournament.
• The existence and uniqueness of strong kings in tournaments
• Searching for Sorted Sequences of Kings in Tournaments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014449)