Minimal blocking flow in networks

DOI10.1007/BF01074781MaRDI QIDQ3026702zbMATH OpenOpenAlexFDO

Authors V. Malyshko, Frank Harary

Publication date 1986

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01074781

zbMATH Keywords

approximate polynomial algorithmblockingnonoriented network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Recommendations

• Non-interfering network flows
• scientific article; zbMATH DE number 926181
• scientific article; zbMATH DE number 1116645
• A simple version of Karzanov's blocking flow algorithm
• scientific article; zbMATH DE number 4079141

Cited in

(12)

• The parallel complexity of finding a blocking flow in a 3-layer network
• A parallel algorithm for finding a blocking flow in an acyclic network
• Minimum blocking configurations
• An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network
• scientific article; zbMATH DE number 5997367 (Why is no real title available?)
• Minimum saturated flow problem in directed network and its algorithm
• scientific article; zbMATH DE number 4041594 (Why is no real title available?)
• scientific article; zbMATH DE number 4093147 (Why is no real title available?)
• scientific article; zbMATH DE number 1116645 (Why is no real title available?)
• The minimum spanning flow in a network and its self‐organization principle
• scientific article; zbMATH DE number 926181 (Why is no real title available?)
• The minimum cover flow problem in networks

This page was built for publication: Minimal blocking flow in networks

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