scientific article; zbMATH DE number 3619587

zbMath0398.90040MaRDI QIDQ4182218

Hans-Georg Carstens, Hans Jürgen Prömel, Ulrich Abel, Walter A. Deuber

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Maximal FlowHypergraphic NetworksNp-Hard Problem

Mathematics Subject Classification ID

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

Related Items

Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation