A Minimax Theorem for Directed Graphs

Cited in

(85)

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