Finding kings in tournaments

DOI10.1016/j.dam.2022.08.014zbMath1498.05111OpenAlexW4295797262MaRDI QIDQ2081490

Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Varunkumar Jayapaul

Publication date: 13 October 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.08.014

zbMATH Keywords

tournamentdominating setking\(d\)-cover

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Banks set in infinite spaces
• On finding a minimum dominating set in a tournament
• On the bounded domination number of tournaments
• On limited nondeterminism and the complexity of the V-C dimension
• The existence and uniqueness of strong kings in tournaments
• Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime
• The Computational Complexity of Choice Sets
• Sorting and Selection with Imprecise Comparisons
• Finding Scores in Tournaments
• Searching for Sorted Sequences of Kings in Tournaments
• A Constructive Solution to a Tournament Problem

This page was built for publication: Finding kings in tournaments