A Minimax Theorem for Directed Graphs

Cited in

(98)

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

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)