scientific article; zbMATH DE number 4041594

zbMATH Open0638.90037MaRDI QIDQ3779971FDOQ3779971

Authors: Bogdan S. Chlebus, Krzysztof Diks, Marek Chrobak 

Publication date: 1987

Title of this publication is not available (Why is that?)

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

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)

Cited In (11)

• Flow on Sweeping Networks
• Title not available (Why is that?)
• 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.
• Title not available (Why is that?)
• Title not available (Why is that?)

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)