A theorem on flows in networks
From MaRDI portal
Publication:770930
DOI10.2140/PJM.1957.7.1073zbMath0087.16303OpenAlexW4255280903MaRDI QIDQ770930
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
Related Items (only showing first 100 items - show all)
On the properties of interchange operations in classes of \((0,1)\)- matrices ⋮ Conditions for the existence of solutions of the three-dimensional planar transportation problem ⋮ An extremal problem on bigraphic pairs with an \(A\)-connected realization ⋮ Planar bipartite biregular degree sequences ⋮ Single-commodity robust network design with finite and hose demand sets ⋮ Bipartite regulation numbers ⋮ The bipartite-splittance of a bipartite graph ⋮ Colour degree matrices of graphs with at most one cycle ⋮ Constructing integral matrices with given line sums ⋮ Realizability and uniqueness in graphs ⋮ On the eigenvalues of the structure matrix of matrices of zeros and ones ⋮ Leaf realization problem, caterpillar graphs and prefix normal words ⋮ Interval stochastic matrices: A combinatorial lemma and the computation of invariant measures of dynamical systems ⋮ Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions ⋮ Simple existence conditions for zero-one matrices with at most one structural zero in each row and column ⋮ Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm ⋮ On the existence of sequences and matrices with prescribed partial sums of elements ⋮ Balanced home-away assignments ⋮ Arranging apples in an array ⋮ Exact sampling and counting for fixed-margin matrices ⋮ Feasibility in uncapacitated networks: The effect of individual arcs and nodes ⋮ On nearly self-conjugate partitions of a finite set ⋮ Integer matrices with constraints on leading partial row and column sums ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Feasibility in capacitated networks: The effect of individual arcs and nodes ⋮ Dually vertex-oblique graphs ⋮ Constructing (0,1)-matrices with large minimal defining sets ⋮ Rounding in symmetric matrices and undirected graphs ⋮ A note on the characterization of digraphic sequences ⋮ Some approaches for solving the general (\(t,k\))-design existence problem and other related problems ⋮ Reconstructing convex matrices by integer programming approaches ⋮ Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs ⋮ On Ryser's maximum term rank formula ⋮ Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem ⋮ Degree sequences and edge connectivity ⋮ Efficiency in decentralized oligopolistic markets ⋮ A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs ⋮ A majorization theorem for the C-matrices of binary designs ⋮ Constructive extensions of two results on graphic sequences ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ Certificates of optimality: the third way to biproportional apportionment ⋮ Bigraphic pairs with an \(A\)-connected realization ⋮ Random graphs with a given degree sequence ⋮ Wide partitions, Latin tableaux, and Rota's basis conjecture ⋮ Matrices of 0's and 1's with total support ⋮ The class A(R,S) of (0,1)-matrices ⋮ A survey of dynamic network flows ⋮ Triangular (0,1)-matrices with prescribed row and column sums ⋮ The maximal length of a chain in the Bruhat order for a class of binary matrices ⋮ Stuttering blocks of Ariki-Koike algebras ⋮ Exact embedding of two \(G\)-designs into a \((G+e)\)-design ⋮ A canonical construction for nonnegative integral matrices with given line sums ⋮ A parameterized algorithmics framework for degree sequence completion problems in directed graphs ⋮ Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros ⋮ A constructive extension of the characterization on potentially \(K_{s,t}\)-bigraphic pairs ⋮ Analysis on the strip-based projection model for discrete tomography ⋮ An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences ⋮ Block-transitive \(t\)-designs. I: Point-imprimitive designs ⋮ Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ Contributions to the theory of graphic sequences ⋮ Integral matrices with given row and column sums ⋮ Enumeration and simulation methods for 0-1 matrices with given marginals ⋮ New linearizations of quadratic assignment problems ⋮ Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard ⋮ Majorization permutahedra and (0,1)-matrices ⋮ Pairs of sequences with a unique realization by bipartite graphs ⋮ On the realization of a (p,s)-digraph with prescribed degrees ⋮ Blocking pairs of polyhedra arising from network flows ⋮ The probabilistic serial mechanism with private endowments ⋮ Young diagrams, Schur functions, the Gale-Ryser theorem and a conjecture or Snapper ⋮ An efficient MCMC algorithm to sample binary matrices with fixed marginals ⋮ Construction of Hamiltonian graphs and bigraphs with prescribed degrees ⋮ Generic iterative subset algorithms for discrete tomography ⋮ Analytic proofs of a network feasibility theorem and a theorem of Fulkerson ⋮ On the spectral structure of monic matrix polynomials and the extension problem ⋮ Bidimensional allocation of seats via zero-one matrices with given line sums ⋮ Biproportional scaling of matrices and the iterative proportional fitting procedure ⋮ A theory of subjective compound lotteries ⋮ 2-partition-transitive tournaments ⋮ Sets of uniqueness and minimal matrices ⋮ On (0, 1)-matrices with prescribed row and column sum vectors ⋮ Characterizing multiterminal flow networks and computing flows in networks of small treewidth ⋮ Maximum balanced flow in a network ⋮ Term rank of \(0,1\) matrices ⋮ Diagnosing infeasibilities in network flow problems ⋮ Linear-time certifying algorithms for near-graphical sequences ⋮ Prime interchange graphs of classes of matrices of zeros and ones ⋮ On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\) ⋮ On extremal multiflows ⋮ A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources ⋮ On normal matrices of zeros and ones with fixed row sum ⋮ Matrices of zeros and ones with the maximum jump number ⋮ The class of matrices of zeros, ones, and twos with prescribed row and column sums ⋮ A set covering reformulation of the pure fixed charge transportation problem ⋮ Multiparametric demand transportation problem ⋮ Existence and constructions of connected block designs with given vectors of treatment replications and block sizes ⋮ The facets of the polyhedral set determined by the Gale-Hoffman inequalities ⋮ Compact formulations of the Steiner traveling salesman problem and related problems ⋮ Degree sequences and majorization ⋮ On Gale's feasibility theorem for certain infinite networks
This page was built for publication: A theorem on flows in networks
