Possible Winners in Partially Completed Tournaments
From MaRDI portal
Publication:5524214
DOI10.1137/1008062zbMath0146.41503OpenAlexW2077123737WikidataQ56018631 ScholiaQ56018631MaRDI QIDQ5524214
Publication date: 1966
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1008062
Related Items (12)
On skew primeness of inner functions ⋮ The computational complexity of the elimination problem in generalized sports competitions ⋮ Unnamed Item ⋮ Soccer is Harder Than Football ⋮ Refining the complexity of the sports elimination problem ⋮ A connection between sports and matroids: how many teams can we beat? ⋮ Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs ⋮ A fast algorithm for the generalized parametric minimum cut problem and applications ⋮ A new?old algorithm for minimum-cut and maximum-flow in closure graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Baseball playoff eliminations: An application of linear programming. Erratum
This page was built for publication: Possible Winners in Partially Completed Tournaments
