A tournament of order 14 with disjoint Banks and Slater sets
From MaRDI portal
Publication:968179
DOI10.1016/j.dam.2009.10.003zbMath1215.05080OpenAlexW1993083657MaRDI QIDQ968179
Patric R. J. Östergård, Vesa P. Vaskelainen
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.10.003
Related Items (3)
Maximum distance between Slater orders and Copeland orders of tournaments ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Bounds on the disparity and separation of tournament solutions
Cites Work
- Unnamed Item
- Unnamed Item
- Slater's winners of a tournament may not be in the Banks set
- Classification algorithms for codes and designs
- Sophisticated voting outcomes and agenda control
- Choosing from a tournament
- Tournament solutions and majority voting
- A 16-vertex tournament for which Banks set and Slater set are disjoint
- A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- Banks winners in tournaments are difficult to recognize
- A survey on the linear ordering problem for weighted or unweighted tournaments
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
- Ranking Tournaments
- Algorithms for finding maximum transitive subtournaments
This page was built for publication: A tournament of order 14 with disjoint Banks and Slater sets
