Minimum saturated flow problem in directed network and its algorithm

MaRDI QIDQ3610172zbMATH OpenFDO

Authors

Publication date 6 March 2009

zbMATH Keywords

blocking-cutestminimum complete cutestminimum saturated flow out of ring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• The minimum cover flow problem in networks
• scientific article; zbMATH DE number 4041594
• Minimum flows in (s,t) planar networks
• scientific article; zbMATH DE number 4079141
• Minimal blocking flow in networks

Cited in

(1)

• The minimum cover flow problem in networks

This page was built for publication: Minimum saturated flow problem in directed network and its algorithm

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