A Minimax Theorem for Directed Graphs
From MaRDI portal
Publication:4173379
DOI10.1112/jlms/s2-17.3.369zbMath0392.05029OpenAlexW1975433230MaRDI QIDQ4173379
Daniel H. Younger, Cláudio Leonardo Lucchesi
Publication date: 1978
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-17.3.369
Directed GraphsMinimax TheoremFeedback SetFinite Plenam Directed GraphMutually Disjoint Directed Coboundaries
Related Items
On the acyclic subgraph polytope, The positive circuits of oriented matroids with the packing property or idealness, A strongly polynomial minimum cost circulation algorithm, Polyhedral proof methods in combinatorial optimization, Idealness of k-wise Intersecting Families, Conservative weightings and ear-decompositions of graphs, Disjoint dijoins, Disjoint dijoins for classes of dicuts in finite and infinite digraphs, On digraphs with no two disjoint directed cycles, The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes, An out-of-kilter method for submodular flows, On enumerating all minimal solutions of feedback problems, On the integral dicycle packings and covers and the linear ordering polytope, An algorithm for minimum cost arc-connectivity orientations, NP-completeness of some edge-disjoint paths problems, Directed cut transversal packing for source-sink connected graphs, Intersection properties of maximal directed cuts in digraphs, Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers, Approximate min-max relations on plane graphs, Generalized polymatroids and submodular flows, Singularities of toric varieties associated with finite distributive lattices, An application of submodular flows, Recent techniques and results on the Erdős-Pósa property, Packing arc-disjoint cycles in tournaments, Khovanov-Rozansky homology and directed cycles, On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes, Packing circuits in eulerian digraphs, Erdös-Pósa Property of Obstructions to Interval Graphs, Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams, Tight Localizations of Feedback Sets, An Exact Method for the Minimum Feedback Arc Set Problem, 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, Canonical modules of certain edge subrings, A counterexample to a conjecture of Edmonds and Giles, A survey of parameterized algorithms and the complexity of edge modification, Linkless and flat embeddings in 3-space, Forcing and anti-forcing polynomials of a type of polyomino graphs, Packing cycles in graphs. II, Fractional packing in ideal clutters, A Survey on Covering Supermodular Functions, Multiflow Feasibility: An Annotated Tableau, Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids, How to make a digraph strongly connected, The ellipsoid method and its consequences in combinatorial optimization, Packing directed circuits exactly, Ranking tournaments with no errors. II: Minimax relation, The strongest facets of the acyclic subgraph polytope are unknown, Proving total dual integrality with cross-free families—A general framework, Note on a min-max conjecture of Woodall, Small feedback vertex sets in planar digraphs, Planar graph bipartization in linear time, On the ratio of optimal integral and fractional covers, On two minimax theorems in graph, A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows, Exact localisations of feedback sets, A new infinite class of ideal minimally non-packing clutters, Ranking tournaments with no errors. I: Structural description, The matroids with the max-flow min-cut property, Anti-forcing numbers of perfect matchings of graphs, Acyclic subgraphs of planar digraphs, Anti-forcing polynomials for benzenoid systems with forcing edges, Idealness and 2-resistant sets, Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs, Ideal Clutters That Do Not Pack, Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs, Integral infeasibility and testing total dual integrality, The star dichromatic number, Polyhedra related to a lattice, On the complexity of solution extension of optimization problems, Tournaments and Semicomplete Digraphs, Euler Digraphs, Forcing matchings on square grids, Recent trends in combinatorial optimization, Packing and covering of crossing families of cuts, Colouring non-even digraphs, Finding feasible vectors of Edmonds-Giles polyhedra, A family of perfect graphs associated with directed graphs, Unnamed Item, A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs, Idealness of \(k\)-wise intersecting families
