A tournament of order 14 with disjoint Banks and Slater sets
From MaRDI portal
(Redirected from Publication:968179)
Recommendations
- A 16-vertex tournament for which Banks set and Slater set are disjoint
- A smallest tournament for which the Banks set and the Copeland set are disjoint
- Slater orders and Hamiltonian paths of tournaments
- On the complexity of Slater's problems
- Bounds on the disparity and separation of tournament solutions
Cites work
- A 16-vertex tournament for which Banks set and Slater set are disjoint
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Algorithms for finding maximum transitive subtournaments
- Banks winners in tournaments are difficult to recognize
- Choosing from a tournament
- Classification algorithms for codes and designs
- scientific article; zbMATH DE number 3675933 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- Ranking Tournaments
- Slater's winners of a tournament may not be in the Banks set
- Sophisticated voting outcomes and agenda control
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
- Tournament solutions and majority voting
Cited in
(6)- A 16-vertex tournament for which Banks set and Slater set are disjoint
- Bounds on the disparity and separation of tournament solutions
- A smallest tournament for which the Banks set and the Copeland set are disjoint
- Maximum distance between Slater orders and Copeland orders of tournaments
- The banks set and the bipartisan set may be disjoint
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication: A tournament of order 14 with disjoint Banks and Slater sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968179)