Minimum flows in unit capacity networks

MaRDI QIDQ4900326zbMATH OpenFDO

Authors Eleonor Ciurea, Oana Georgescu

Publication date 14 January 2013

zbMATH Keywords

minimum flow problemnetwork algorithmsnetwork flowsunit capacity networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Flows in Undirected Unit Capacity Networks
• scientific article; zbMATH DE number 5997367
• Minimum flows in directed s-t planar networks
• Minimum-cost flows in unit-capacity networks
• Minimum flows in (s,t) planar networks

Cited in

(7)

• Minimum-cost flows in unit-capacity networks
• Sequential and parallel algorithms for minimum flows.
• scientific article; zbMATH DE number 5997367 (Why is no real title available?)
• Flows in Undirected Unit Capacity Networks
• scientific article; zbMATH DE number 903085 (Why is no real title available?)
• The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate
• Bottleneck flows in unit capacity networks

This page was built for publication: Minimum flows in unit capacity networks

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