Finding Scores in Tournaments

DOI10.1006/JAGM.1997.0865MaRDI QIDQ4360138zbMATH OpenOpenAlexFDO

Authors

Publication date 1 June 1998

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1997.0865

zbMATH Keywords

directed treestournaments

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• The complexity of finding certain trees in tournaments
• Tight bounds for finding degrees from the adjacency matrix
• On scores in tournaments
• The complexity of finding generalized paths in tournaments
• Elusiveness of finding degrees

Cited in

(20)

• Finding kings in tournaments
• Elusiveness of finding degrees
• On scores in tournaments
• On the score sheets of a round-robin football tournament
• Elusiveness of finding degrees
• The complexity of finding generalized paths in tournaments
• The complexity of finding (approximate sized) distance-d dominating set in tournaments
• The complexity of finding certain trees in tournaments
• Tight bounds for finding degrees from the adjacency matrix
• Scorekeeping
• Sublinear-Time Algorithms for Tournament Graphs
• Single-Elimination Brackets Fail to Approximate Copeland Winner.
• Query complexity of tournament solutions
• Sublinear-time algorithms for tournament graphs
• An optimal algorithm to find champions of tournament graphs
• On the communication complexity of finding a king in a tournament
• Randomized and quantum query complexities of finding a king in a tournament
• From donkeys to kings in tournaments
• On score sets in tournaments
• Tournament scoring problem

This page was built for publication: Finding Scores in Tournaments

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