A theorem on flows in networks

Cited in

(only showing first 100 items - show all)

Exact embedding of two \(G\)-designs into a \((G+e)\)-design
A survey of dynamic network flows
Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
On the degrees of the vertices of a directed graph
A catalog of steiner tree formulations
A canonical construction for nonnegative integral matrices with given line sums
A constructive extension of the characterization on potentially \(K_{s,t}\)-bigraphic pairs
On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
The Grone-Merris conjecture
Single-commodity robust network design with finite and hose demand sets
Bayesian persuasion: reduced form approach
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
Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
On the realization of a (p,s)-digraph with prescribed degrees
Majorization permutahedra and (0,1)-matrices
Sets of uniqueness and minimal matrices
An extremal problem on bigraphic pairs with an \(A\)-connected realization
On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
Pairs of sequences with a unique realization by bipartite graphs
Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
Term rank of \(0,1\) matrices
Random graphs with a given degree sequence
Certificates of optimality: the third way to biproportional apportionment
Degree sequences and edge connectivity
A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs
Consistency, redundancy, and implied equalities in linear systems
Constructive extensions of two results on graphic sequences
Generic iterative subset algorithms for discrete tomography
Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
Complexity and algorithms for nonlinear optimization problems
Maximum-Minimum Sätze über Graphen
Constructing integral matrices with given line sums
Exact sampling and counting for fixed-margin matrices
The probabilistic serial mechanism with private endowments
Characterizing multiterminal flow networks and computing flows in networks of small treewidth
Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
Matrices of zeros and ones with given line sums and a zero block
A note on the characterization of digraphic sequences
Bidimensional allocation of seats via zero-one matrices with given line sums
On (0, 1)-matrices with prescribed row and column sum vectors
Integral matrices with given row and column sums
A network simplex method
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
Integer matrices with constraints on leading partial row and column sums
scientific article; zbMATH DE number 1334601 (Why is no real title available?)
Matrices of zeros and ones with given line sums and a zero block
Some approaches for solving the general (\(t,k\))-design existence problem and other related problems
Reconstructing convex matrices by integer programming approaches
Compact formulations of the Steiner traveling salesman problem and related problems
Minimal matrices and discrete tomography
The maximal length of a chain in the Bruhat order for a class of binary matrices
An efficient MCMC algorithm to sample binary matrices with fixed marginals
Efficient, fair, and strategy-proof (re)allocation under network constraints
Contributions to the theory of graphic sequences
Block-transitive \(t\)-designs. I: Point-imprimitive designs
Defining sets and critical sets in \((0,1)\)-matrices
Solutions to problems about potentially \(K_{s,t}\)-bigraphic pair
Sufficient conditions for graphicality of bidegree sequences
On the swap-distances of different realizations of a graphical degree sequence
Bigraphic pairs with an \(A\)-connected realization
Realizability and uniqueness in graphs
Young diagrams, Schur functions, the Gale-Ryser theorem and a conjecture or Snapper
A sufficient condition for a pair of sequences to be bipartite graphic
A comparative analysis of several formulations for the generalized minimum spanning tree problem
Enumeration and simulation methods for 0-1 matrices with given marginals
Plane partitions and characters of the symmetric group
A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros
Optimal Construction of Edge-Disjoint Paths in Random Graphs
An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
Bemerkungen zur Theorie der Matrizen aus Nullen und Einsen
A set covering reformulation of the pure fixed charge transportation problem
Conditions for the existence of solutions of the three-dimensional planar transportation problem
Analysis on the strip-based projection model for discrete tomography
Matrices of zeros and ones
The time dependent traveling salesman problem: polyhedra and algorithm
Solving stochastic programs with network recourse
Prime interchange graphs of classes of matrices of zeros and ones
Colour degree matrices of graphs with at most one cycle
Matrices of 0's and 1's with total support
A theory of subjective compound lotteries
On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
Efficiency in decentralized oligopolistic markets
Systems of representatives
On double-resolution imaging and discrete tomography
Existence and constructions of connected block designs with given vectors of treatment replications and block sizes
Reformulating linear programs with transportation constraints-With applications to workforce scheduling
Invariant Sets for Classes of Matrices of Zeros and Ones
Inequalities and existence theorems in the theory of matrices
The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\)
A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins
Interval stochastic matrices: A combinatorial lemma and the computation of invariant measures of dynamical systems
Optimization and reconstruction of hv-convex (0,1)-matrices
The bipartite-splittance of a bipartite graph
Degree sequences and majorization
The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
On an inequality of A. Khintchine for zero-one matrices
An evolutionary algorithm for discrete tomography

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)