On the relation of max-flow to min-cut for generalized networks
From MaRDI portal
(Redirected from Publication:1122471)
Recommendations
Cites work
Cited in
(10)- The max-flow min-cut property and \(\pm 1\)-resistant sets
- scientific article; zbMATH DE number 4053314 (Why is no real title available?)
- Recognizing max-flow min-cut path matrices
- Maximum outflow in generalized flow networks
- A decomposition algorithm to determine the maximum flow in a generalized network
- A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
- scientific article; zbMATH DE number 780168 (Why is no real title available?)
- scientific article; zbMATH DE number 2086656 (Why is no real title available?)
- Maximum flow in fiber-optic networks
- Modified Pulat's algorithm for the maximum outflow problem in undirected generalized networks
This page was built for publication: On the relation of max-flow to min-cut for generalized networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122471)