Some networks that allow splashes of dynamic flows and finding the maximum splash value

DOI10.1007/S10958-023-06385-2MaRDI QIDQ6147745zbMATH OpenFDO

Authors I. M. Erusalimskiy, V. A. Rusakov

Publication date 1 February 2024

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10958-023-06385-2

zbMATH Keywords

dynamic flowedge capacityflow networkminimum cutnetwork flow splashstatic flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 5885647
• The maximum flow in dynamic networks
• Constructing maximal dynamic flows from static flows
• scientific article; zbMATH DE number 3980874
• Maximum flows in bipartite dynamic networks

Cites work

• Networks. An introduction.

This page was built for publication: Some networks that allow splashes of dynamic flows and finding the maximum splash value

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