Simple Constructions for Multiterminal Network Flow Synthesis

DOI10.1137/0212010zbMATH Open0504.90083OpenAlexW2055310760MaRDI QIDQ4740356FDOQ4740356

Authors: Dan Gusfield 

Publication date: 1983

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0212010

zbMATH Keywords

sensitivity analysiscombinatorial optimizationgraph algorithmsnetwork designplanar graphsmulti-terminal network flow synthesissimpler algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Sensitivity, stability, parametric optimization (90C31)

Cited In (3)

• On the robustness of potential-based flow networks
• Integer version of the multipath flow network synthesis problem
• Multiroute flows: cut-trees and realizability

This page was built for publication: Simple Constructions for Multiterminal Network Flow Synthesis

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