Pages that link to "Item:Q1234694"
From MaRDI portal
The following pages link to Optimally ranking unrankable tournaments (Q1234694):
Displaying 13 items.
- Intersections of random hypergraphs and tournaments (Q472404) (← links)
- A fast and effective heuristic for the feedback arc set problem (Q688447) (← links)
- On the maximum cardinality of a consistent set of arcs in a random tournament (Q788001) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- The reversing number of a digraph (Q1894351) (← links)
- On explicit random-like tournaments (Q2042219) (← links)
- Paths with many shortcuts in tournaments (Q2219961) (← links)
- The number of tournaments with the minimum number of upsets (Q2303437) (← links)
- A constructive solution to a problem of ranking tournaments (Q2329199) (← links)
- (Q5071138) (← links)
- Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
- Invertibility of Digraphs and Tournaments (Q6141864) (← links)
- A better LP rounding for feedback arc set on tournaments (Q6614011) (← links)