The network flows approach for matrices with given row and column sums

DOI10.1016/0012-365X(83)90053-5zbMATH Open0516.05036OpenAlexW2030820640MaRDI QIDQ1052337

Richard P. Anstee

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90053-5

zbMATH Keywords

split graphsdegree sequencethreshold graphsmaximum integral flows

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraphs with no special cycles
• Properties of (0,1)-matrices with no triangles
• Matrices of zeros and ones with fixed row and column sum vectors
• The splittance of a graph
• Properties of a Class of (0,1)-Matrices Covering a given Matrix
• Some Properties of Graphs with Multiple Edges
• Combinatorial theorems and integral matrices

Related Items (14)

A network flow algorithm for reconstructing binary images from discrete X-rays ⋮ Binary vectors partially determined by linear equation systems ⋮ On joint realization of (0,1) matrices ⋮ Hypergraphs with no special cycles ⋮ Matrices with prescribed row, column and block sums ⋮ On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples ⋮ Graphs and degree sequences. I ⋮ Sign-restricted matrices of 0's, 1's, and \(-1\)'s ⋮ Approximating Bicolored Images from Discrete Projections ⋮ Towards the linear arboricity conjecture ⋮ Integral matrices with given row and column sums ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ The class of matrices of zeros, ones, and twos with prescribed row and column sums ⋮ Invariant sets of arcs in network flow problems

This page was built for publication: The network flows approach for matrices with given row and column sums