A Network-Flow Feasibility Theorem and Combinatorial Applications

DOI10.4153/CJM-1959-045-1MaRDI QIDQ3278679zbMATH OpenOpenAlexFDO

Authors D. R. Fulkerson

Publication date 1959

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cjm-1959-045-1

zbMATH Keywords

applications of probability theory and statistics

Cited in

(9)

• Subgraphs and their degree sequences of a digraph
• Switchdec polyhedra
• Consistency, redundancy, and implied equalities in linear systems
• A principle of symmetry in networks
• Multimodal transport network systems interface, interaction coordination: A specification for control systems integration
• The rank formula of Nash-Williams as a source of covering and packing theorems
• Matrices of zeros and ones
• Optimal (0, 1)-matrix completion with majorization ordered objectives
• A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs

This page was built for publication: A Network-Flow Feasibility Theorem and Combinatorial Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3278679)