Searching for Sorted Sequences of Kings in Tournaments

DOI10.1137/S0097539702410053zbMATH Open1026.05051OpenAlexW2038824882MaRDI QIDQ4429682FDOQ4429682

Authors: J. Shen, Li Sheng, Jie Wu 

Publication date: 28 September 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702410053

Recommendations

• An efficient sorting algorithm for a sequence of kings in a tournament.
• Sorting a sequence of strong kings in a tournament
• Finding kings in tournaments
• Kings in strong tournaments.
• scientific article; zbMATH DE number 4025468

zbMATH Keywords

tournamentdivide-and-conquer algorithmrecursive relationadversary argumentsorted sequence of kings

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Cited In (6)

• Kings, name days, lazy servants and magic
• The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments
• Sorting a sequence of strong kings in a tournament
• An efficient sorting algorithm for a sequence of kings in a tournament.
• Finding kings in tournaments
• An optimal algorithm to find champions of tournament graphs

This page was built for publication: Searching for Sorted Sequences of Kings in Tournaments

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