Pages that link to "Item:Q1767293"
From MaRDI portal
The following pages link to A note on ``Bank winners in tournaments are difficult to recognize'' by G. J. Woeginger (Q1767293):
Displaying 11 items.
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView (Q383785) (← links)
- Computing the minimal covering set (Q943589) (← links)
- A tournament of order 14 with disjoint Banks and Slater sets (Q968179) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- On the complexity of Slater's problems (Q1043351) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Minimal extending sets in tournaments (Q2406936) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- Collective decision making (Q6602233) (← links)
