Minimizing maximum flows in linear graphs

DOI10.1002/net.3230090405zbMath0428.90020OpenAlexW2075897105MaRDI QIDQ3865814

Gyula A. Mago, Donald F. Stanat

Publication date: 1979

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230090405

zbMATH Keywords

polynomial algorithmssinkssourcesmaximum flowflows in networkslinear graph

Mathematics Subject Classification ID

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

Related Items (2)

Optimal sharing ⋮ Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment

Cites Work

• Unnamed Item

This page was built for publication: Minimizing maximum flows in linear graphs