A Minimax Theorem for Directed Graphs

Cited In (85)

Ranking tournaments with no errors. II: Minimax relation
The positive circuits of oriented matroids with the packing property or idealness
Tight localizations of feedback sets
Idealness and 2-resistant sets
Ranking tournaments with no errors. I: Structural description
Max-flow min-cut theorem for directed fuzzy incidence networks
Idealness of \(k\)-wise intersecting families
Erdös-Pósa Property of Obstructions to Interval Graphs
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
Euler digraphs
Idealness of \(k\)-wise intersecting families
An exact method for the minimum feedback arc set problem
The star dichromatic number
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
Efficient heuristics to compute minimal and stable feedback arc sets
Disjoint dijoins for classes of dicuts in finite and infinite digraphs
Forcing and anti-forcing polynomials of a type of polyomino graphs
Erdős–Pósa property of obstructions to interval graphs
Khovanov-Rozansky homology and directed cycles
On the infinite Lucchesi–Younger conjecture I
Colouring non-even digraphs
Anti-forcing polynomials for benzenoid systems with forcing edges
On the complexity of solution extension of optimization problems
On digraphs with no two disjoint directed cycles
Conservative weightings and ear-decompositions of graphs
Polyhedra related to a lattice
Linkless and flat embeddings in 3-space
An application of submodular flows
The ellipsoid method and its consequences in combinatorial optimization
On the ratio of optimal integral and fractional covers
A branch-price-and-cut algorithm for packing cuts in undirected graphs
Bayesian network learning via topological order
Disjoint dijoins
The strongest facets of the acyclic subgraph polytope are unknown
Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers
Packing cycles in graphs. II
Exact localisations of feedback sets
On Packing Dijoins in Digraphs and Weighted Digraphs
Ideal clutters that do not pack
An algorithm for minimum cost arc-connectivity orientations
Forcing matchings on square grids
A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows
Finding feasible vectors of Edmonds-Giles polyhedra
A survey of parameterized algorithms and the complexity of edge modification
Acyclic subgraphs of planar digraphs
How to make a digraph strongly connected
Fractional packing in ideal clutters
A counterexample to a conjecture of Edmonds and Giles
Packing circuits in eulerian digraphs
A strongly polynomial minimum cost circulation algorithm
An out-of-kilter method for submodular flows
Generalized polymatroids and submodular flows
Intersection properties of maximal directed cuts in digraphs
Approximate min-max relations on plane graphs
On the integral dicycle packings and covers and the linear ordering polytope
On two minimax theorems in graph
The matroids with the max-flow min-cut property
Polyhedral proof methods in combinatorial optimization
Integral infeasibility and testing total dual integrality
Directed cut transversal packing for source-sink connected graphs
A Survey on Covering Supermodular Functions
Tournaments and Semicomplete Digraphs
A new infinite class of ideal minimally non-packing clutters
Proving total dual integrality with cross-free families—A general framework
Note on a min-max conjecture of Woodall
On enumerating all minimal solutions of feedback problems
Packing and covering of crossing families of cuts
Multiflow Feasibility: An Annotated Tableau
Planar graph bipartization in linear time
Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs
On the acyclic subgraph polytope
A family of perfect graphs associated with directed graphs
Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
Packing directed circuits exactly
Recent trends in combinatorial optimization
Canonical modules of certain edge subrings
Packing arc-disjoint cycles in tournaments
Recent techniques and results on the Erdős-Pósa property
The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes
Anti-forcing numbers of perfect matchings of graphs
Singularities of toric varieties associated with finite distributive lattices
On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
NP-completeness of some edge-disjoint paths problems
Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
Small feedback vertex sets in planar digraphs

This page was built for publication: A Minimax Theorem for Directed Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4173379)