Ranking tournaments with no errors. II: Minimax relation (Q1985451): Difference between revisions

@@ Property / DOI @@
-.1016/j.jctb.2019.10.004
@@ Property / DOI: 10.1016/j.jctb.2019.10.004 / rank @@
-Normal rank
@@ Property / cites work @@
+Integral infeasibility and testing total dual integrality
+Normal rank
@@ Property / cites work @@
+Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for Feedback Vertex Sets in Tournaments
+Normal rank
@@ Property / cites work @@
+Ranking tournaments with no errors. I: Structural description
+Normal rank
@@ Property / cites work @@
+Packing cycles in graphs. II
@@ Property / cites work: Packing cycles in graphs. II / rank @@
+Normal rank
@@ Property / cites work @@
+Packing cycles in graphs
@@ Property / cites work: Packing cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4149476
@@ Property / cites work: Q4149476 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing odd circuits in Eulerian graphs
@@ Property / cites work: Packing odd circuits in Eulerian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4537698
@@ Property / cites work: Q4537698 / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
+Normal rank
@@ Property / cites work @@
+Packing directed circuits exactly
@@ Property / cites work: Packing directed circuits exactly / rank @@
+Normal rank
@@ Property / cites work @@
+A Minimax Theorem for Directed Graphs
@@ Property / cites work: A Minimax Theorem for Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+The matroids with the max-flow min-cut property
@@ Property / cites work: The matroids with the max-flow min-cut property / rank @@
+Normal rank
@@ Property / cites work @@
+Packing circuits in eulerian digraphs
@@ Property / cites work: Packing circuits in eulerian digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTB.2019.10.004
@@ Property / DOI: 10.1016/J.JCTB.2019.10.004 / rank @@
+Normal rank