Pages that link to "Item:Q5524214"
From MaRDI portal
The following pages link to Possible Winners in Partially Completed Tournaments (Q5524214):
Displayed 12 items.
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- Baseball playoff eliminations: An application of linear programming. Erratum (Q807312) (← links)
- Refining the complexity of the sports elimination problem (Q896666) (← links)
- A fast algorithm for the generalized parametric minimum cut problem and applications (Q1186785) (← links)
- On skew primeness of inner functions (Q1336429) (← links)
- A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
- The computational complexity of the elimination problem in generalized sports competitions (Q2386202) (← links)
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651) (← links)
- Soccer is Harder Than Football (Q2947803) (← links)
- (Q4972740) (← links)
- (Q5111621) (← links)
- (Q5136330) (← links)