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
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, Reconstruction of Convex Sets from One or Two X-rays, On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples, Graph realizations: maximum degree in vertex neighborhoods, Bayesian persuasion: reduced form approach, Approximating fractionally isomorphic graphons, Weighted projections of alternating sign matrices: Latin-like squares and the ASM polytope, The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\), Optimal \((0, 1)\)-matrix completion with majorization ordered objectives, Ribbon graphs and Belyi pairs with partially prescribed branching, Non-traditional 2D grids in combinatorial imaging -- advances and challenges, Minimal partitions with a given \(s\)-core and \(t\)-core, Optimal nonparametric testing of missing completely at random and its connections to compatibility, Degree realization by bipartite multigraphs, A Short Proof of Ore’s f-Factor Theorem Using Flows, Matrices of zeros and ones with given line sums and a zero block, Matrices of zeros and ones with given line sums and a zero block, On \(\mathfrak A(R,S)\) all of whose members are indecomposable, Supersaturation problem for the bowtie, On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays, NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs, Composed degree-distance realizations of graphs, Composed degree-distance realizations of graphs, Systems of representatives, Sampling binary contingency tables with a greedy start, A simulated annealing for reconstructing hv-convex binary matrices, Unnamed Item, Efficient, fair, and strategy-proof (re)allocation under network constraints, Metric and ultrametric inequalities for directed graphs, A catalog of steiner tree formulations, Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment, Bemerkungen zur Theorie der Matrizen aus Nullen und Einsen, Constrained flow control in storage networks: capacity maximization and balancing, Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments, A network flow algorithm for reconstructing binary images from discrete X-rays, On assignment functions, Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices, David Gale in Paris, ReGale: some memorable results, Invariant Sets for Classes of Matrices of Zeros and Ones, An inverse problem for the collapsing sum, Inequalities and existence theorems in the theory of matrices, On Double-Resolution Imaging and Discrete Tomography, Mixing time of the switch Markov chain and stable degree sequences, Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization, Unnamed Item, On factorable bigraphic pairs, Extremal values of the chromatic number for a given degree sequence, A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins, Neighborhood degree lists of graphs, Lorentz and Gale–Ryser theorems on general measure spaces, Generalized hose uncertainty in single-commodity robust network design, On vertex-weighted realizations of acyclic and general graphs, Unnamed Item, Sufficient Conditions for Graphicality of Bidegree Sequences, Regular switching components, Alternating signed bipartite graphs and difference-1 colourings, A strongly polynomial algorithm for line search in submodular polyhedra, On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\), The time dependent traveling salesman problem: polyhedra and algorithm, Maximum-Minimum Sätze über Graphen, Constructing bounded degree graphs with prescribed degree and neighbor degree sequences, Solving stochastic programs with network recourse, A Privacy-Preserving Method to Optimize Distributed Resource Allocation, A formulation of the wide partition conjecture using the atom problem in discrete tomography, Matrices of zeros and ones, Spatiotemporal Conditional Inference and Hypothesis Tests for Neural Ensemble Spiking Precision, A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC, Number of 1-factorizations of regular high-degree graphs, Graphs and degree sequences. I, The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization, Graphs with given valences, On the number of zero-patterns of a sequence of polynomials, Plane partitions and characters of the symmetric group, Dynamic discrete tomography, Approximating Bicolored Images from Discrete Projections, Balanced flows for transshipment problems, The mixing time of switch Markov chains: a unified approach, Market implementation of multiple-arrival multiple-deadline differentiated energy services, A new?old algorithm for minimum-cut and maximum-flow in closure graphs, A note on matrics with given diagonal entries, Reformulating linear programs with transportation constraints-With applications to workforce scheduling, The Grone-Merris Conjecture, On matching numbers of tree and bipartite degree sequences, Über reguläre Kettengruppen, Complexity and algorithms for nonlinear optimization problems, On the Swap-Distances of Different Realizations of a Graphical Degree Sequence, A network simplex method, Unnamed Item, Defining Sets and Critical Sets in (0,1)‐Matrices, Graph dismantling problems, A comparative analysis of several formulations for the generalized minimum spanning tree problem, Some formulations for the group Steiner tree problem, Witt vectors. Part 1, Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks, On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs, Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables, The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances, Interpreting linear systems of equalities and inequalities. Application to the water supply problem, Majorization and the number of bipartite graphs for given vertex degrees, Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation, Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs, Unnamed Item, On the degrees of the vertices of a directed graph, Dag Realizations of Directed Degree Sequences, Bigraphic pairs with a realization containing a split bipartite-graph, On an inequality of A. Khintchine for zero-one matrices, On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition, Optimal Construction of Edge-Disjoint Paths in Random Graphs, Solutions to problems about potentially \(K_{s,t}\)-bigraphic pair, Further steps on the reconstruction of convex polyominoes from orthogonal projections, Improved queue-size scaling for input-queued switches via graph factorization, An evolutionary algorithm for discrete tomography, Optimization and reconstruction of \(hv\)-convex (0,1)-matrices, An introduction to periodical discrete sets from a tomographical perspective, Reduction from three-dimensional discrete tomography to multicommodity flow problem, Modular decomposition and reliability computation in stochastic transportation networks having cutnodes, Optimization and reconstruction of hv-convex (0,1)-matrices, An experimental study of the stability problem in discrete tomography, Minimal matrices and discrete tomography, Latin Squares and their Bruhat Order, Relaxed and approximate graph realizations, Binary image reconstruction based on prescribed numerical information, On the bipartite graph packing problem
