An optimal algorithm to find champions of tournament graphs

DOI10.1007/978-3-030-32686-9_19MaRDI QIDQ6536260zbMATH OpenFDO

Authors Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini

Publication date 19 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-32686-9_19

zbMATH Keywords

Copeland winnerround-robin tournamenttournament graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding Scores in Tournaments
• Ranking Tournaments
• Ranking tournaments, local search and a new algorithm
• The complexity of finding certain trees in tournaments
• Online ranking for tournament graphs

Cites work

• A survey on the complexity of tournament solutions
• Handbook of Computational Social Choice
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• Preference-based learning to rank
• Searching for Sorted Sequences of Kings in Tournaments
• Sophisticated voting outcomes and agenda control
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• Tournament solutions and majority voting

This page was built for publication: An optimal algorithm to find champions of tournament graphs

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