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)
- 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?)
- Title not available (Why is that?)
- Über reguläre Kettengruppen
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Latin Squares and their Bruhat Order
- A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins
- On assignment functions
- On matching numbers of tree and bipartite degree sequences
- On extremal multiflows
- Invariant Sets for Classes of Matrices of Zeros and Ones
- Dually vertex-oblique graphs
- Linear-time certifying algorithms for near-graphical sequences
- The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- Title not available (Why is that?)
- A strongly polynomial algorithm for line search in submodular polyhedra
- An experimental study of the stability problem in discrete tomography
- The bipartite-splittance of a bipartite graph
- Biproportional scaling of matrices and the iterative proportional fitting procedure
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
- Degree sequences and majorization
- Rounding in symmetric matrices and undirected graphs
- Balanced home-away assignments
- On the existence of sequences and matrices with prescribed partial sums of elements
- Systems of representatives
- Efficiency in decentralized oligopolistic markets
- Graphs with given valences
- An introduction to periodical discrete sets from a tomographical perspective
- The class A(R,S) of (0,1)-matrices
- Triangular (0,1)-matrices with prescribed row and column sums
- On Double-Resolution Imaging and Discrete Tomography
- Sampling binary contingency tables with a greedy start
- Dynamic discrete tomography
- Reformulating linear programs with transportation constraints-With applications to workforce scheduling
- Optimization and reconstruction of hv-convex (0,1)-matrices
- The class of matrices of zeros, ones, and twos with prescribed row and column sums
- A network flow algorithm for reconstructing binary images from discrete X-rays
- Blocking pairs of polyhedra arising from network flows
- A majorization theorem for the C-matrices of binary designs
- Constructing (0,1)-matrices with large minimal defining sets
- On the spectral structure of monic matrix polynomials and the extension problem
- An evolutionary algorithm for discrete tomography
- Reconstruction of Convex Sets from One or Two X-rays
- Constrained flow control in storage networks: capacity maximization and balancing
- On Ryser's maximum term rank formula
- On normal matrices of zeros and ones with fixed row sum
- 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
- 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
- Sufficient Conditions for Graphicality of Bidegree Sequences
- A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC
- Integer matrices with constraints on leading partial row and column sums
- Plane partitions and characters of the symmetric group
- The Grone-Merris conjecture
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)
