Pages that link to "Item:Q3819090"
From MaRDI portal
The following pages link to Tournament Ranking with Expected Profit in Polynomial Time (Q3819090):
Displaying 10 items.
- Intersections of random hypergraphs and tournaments (Q472404) (← links)
- On existence theorems (Q686508) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A new algorithm for ranking players of a round-robin tournament (Q1342337) (← links)
- Checking robust nonsingularity is NP-hard (Q1802197) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- An improved MST algorithm for ranking players of a round-robin tournament (Q5438689) (← links)
- Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
- Invertibility of Digraphs and Tournaments (Q6141864) (← links)
