A generalization of max flow—min cut-Reference-Cited by-同舟云学术

A generalization of max flow—min cut

Published:1974-12 Issue:1 Volume:6 Page:352-359
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Hoffman A. J.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01580250.pdf

Reference3 articles.

1. G.B. Dantzig and A.J. Hoffman, “Dilworth's theorem on partially ordered sets”, in:Linear inequalities and related systems, Annals of mathematics study No. 38, Eds. H.W. Kuhn and A.W. Tucker (Princeton University Press, Princeton, N.J., 1956) pp. 207–214.

2. J. Edmonds, “Submodular functions, matroids and certain polyhedra”, in:Combinatorial structures and their applications, Eds. H. Guy, H. Hanani, N. Sauer and J. Schonheim (Gordon and Breach, New York, 1970) pp. 69–87.

3. L.R. Ford, Jr. and D.R. Fulkerson, “Maximal flow through a network”,Canadian Journal of Mathematics 8 (1956) 399–404.

Cited by 107 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On non-superperfection of edge intersection graphs of paths;Discrete Optimization;2024-11

2. Arc Connectivity and Submodular Flows in Digraphs;Combinatorica;2024-05-28

3. Decomposing Probability Marginals Beyond Affine Requirements;Lecture Notes in Computer Science;2024

4. DRL-based routing algorithm with guaranteed loss, latency and bandwidth in SDN networks: Application of online video conferencing;Journal of King Saud University - Computer and Information Sciences;2023-12

5. On Packing Dijoins in Digraphs and Weighted Digraphs;SIAM Journal on Discrete Mathematics;2023-10-19