scientific article; zbMATH DE number 4041594

MaRDI QIDQ3779971zbMATH OpenFDO

Authors Bogdan S. Chlebus, Krzysztof Diks, Marek Chrobak

Publication date 1987

zbMATH Keywords

directed multigraphstrongly NP-completeouterplanar networkspseudopolynomial time algorithmedge series- parallel networkssaturating flow

Mathematics Subject Classification ID

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

Recommendations

• Minimal blocking flow in networks
• Network flow and 2-satisfiability
• scientific article; zbMATH DE number 6402605
• Polymatroidal flows with lower bounds
• Non-interfering network flows

Cited in

(11)

• scientific article; zbMATH DE number 2090007 (Why is no real title available?)
• Flow on Sweeping Networks
• scientific article; zbMATH DE number 5885647 (Why is no real title available?)
• Bottleneck flows in unit capacity networks
• Network flow and 2-satisfiability
• Minimum saturated flow problem in directed network and its algorithm
• Flow logic
• The maximum residual flow problem: NP‐hardness with two‐arc destruction
• The minimum cover flow problem in networks
• Limit-saturated edges for the superconcurrent distribution of flows in networks.
• scientific article; zbMATH DE number 4093147 (Why is no real title available?)

This page was built for publication:

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