A theorem on flows in networks
From MaRDI portal
Publication:770930
DOI10.2140/PJM.1957.7.1073zbMATH Open0087.16303OpenAlexW4255280903MaRDI QIDQ770930FDOQ770930
Authors: David Gale 
Publication date: 1957
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1957.7.1073
Cited In (only showing first 100 items - show all)
- Complexity and algorithms for nonlinear optimization problems
- Compact formulations of the Steiner traveling salesman problem and related problems
- A set covering reformulation of the pure fixed charge transportation problem
- On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
- Term rank of \(0,1\) matrices
- Exact sampling and counting for fixed-margin matrices
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Solving stochastic programs with network recourse
- Exact embedding of two \(G\)-designs into a \((G+e)\)-design
- On the realization of a (p,s)-digraph with prescribed degrees
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- Random graphs with a given degree sequence
- A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs
- Constructive extensions of two results on graphic sequences
- A constructive extension of the characterization on potentially \(K_{s,t}\)-bigraphic pairs
- Majorization permutahedra and (0,1)-matrices
- Pairs of sequences with a unique realization by bipartite graphs
- On (0, 1)-matrices with prescribed row and column sum vectors
- Sufficient conditions for graphicality of bidegree sequences
- A sufficient condition for a pair of sequences to be bipartite graphic
- Title not available (Why is that?)
- Contributions to the theory of graphic sequences
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
- An extremal problem on bigraphic pairs with an \(A\)-connected realization
- Bemerkungen zur Theorie der Matrizen aus Nullen und Einsen
- Analysis on the strip-based projection model for discrete tomography
- A theory of subjective compound lotteries
- Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
- Certificates of optimality: the third way to biproportional apportionment
- Generic iterative subset algorithms for discrete tomography
- Realizability and uniqueness in graphs
- Single-commodity robust network design with finite and hose demand sets
- Sets of uniqueness and minimal matrices
- Prime interchange graphs of classes of matrices of zeros and ones
- Colour degree matrices of graphs with at most one cycle
- Bigraphic pairs with an \(A\)-connected realization
- Matrices of zeros and ones with fixed row and column sum vectors
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
- Block-transitive \(t\)-designs. I: Point-imprimitive designs
- Young diagrams, Schur functions, the Gale-Ryser theorem and a conjecture or Snapper
- Integer matrices with constraints on leading partial row and column sums
- Plane partitions and characters of the symmetric group
- The Grone-Merris conjecture
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
- Matrices of zeros and ones with given line sums and a zero block
- Efficient, fair, and strategy-proof (re)allocation under network constraints
- Solutions to problems about potentially \(K_{s,t}\)-bigraphic pair
- Bayesian persuasion: reduced form approach
- Conditions for the existence of solutions of the three-dimensional planar transportation problem
- Consistency, redundancy, and implied equalities in linear systems
- On the degrees of the vertices of a directed graph
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- Optimal Construction of Edge-Disjoint Paths in Random Graphs
- Enumeration and simulation methods for 0-1 matrices with given marginals
- A catalog of steiner tree formulations
- The probabilistic serial mechanism with private endowments
- Matrices of zeros and ones
- The time dependent traveling salesman problem: polyhedra and algorithm
- A survey of dynamic network flows
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth
- A canonical construction for nonnegative integral matrices with given line sums
- Minimal matrices and discrete tomography
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- Maximum-Minimum Sätze über Graphen
- A network simplex method
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
- Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros
- Constructing integral matrices with given line sums
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- Matrices of zeros and ones with given line sums and a zero block
- Bidimensional allocation of seats via zero-one matrices with given line sums
- An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
- Matrices of 0's and 1's with total support
- Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
- A note on the characterization of digraphic sequences
- Defining sets and critical sets in \((0,1)\)-matrices
- On the swap-distances of different realizations of a graphical degree sequence
- Integral matrices with given row and column sums
- Some approaches for solving the general (\(t,k\))-design existence problem and other related problems
- Reconstructing convex matrices by integer programming approaches
- Degree sequences and edge connectivity
- Interval stochastic matrices: A combinatorial lemma and the computation of invariant measures of dynamical systems
- On an inequality of A. Khintchine for zero-one matrices
- Bipartite regulation numbers
- On the eigenvalues of the structure matrix of matrices of zeros and ones
- Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
- Existence and constructions of connected block designs with given vectors of treatment replications and block sizes
- New linearizations of quadratic assignment problems
- On the number of zero-patterns of a sequence of polynomials
- Inequalities and existence theorems in the theory of matrices
- Witt vectors. I
- Arranging apples in an array
- Title not available (Why is that?)
- Über reguläre Kettengruppen
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- On double-resolution imaging and discrete tomography
- A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins
- On assignment functions
This page was built for publication: A theorem on flows in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q770930)
