Playing with the Maximum-Flow Problem

DOI10.29007/TKK1MaRDI QIDQ5222943zbMATH OpenOpenAlexFDO

Authors Orna Kupferman

Publication date 4 July 2019

Published in EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.29007/tkk1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Flows in graphs (05C21) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 6863577
• The maximum concurrent flow problem
• The maximum nearby flow problem
• A new approach to the maximum-flow problem
• scientific article; zbMATH DE number 1062936
• scientific article; zbMATH DE number 1022488
• scientific article; zbMATH DE number 3908126
• Max concurrent flow problem
• The maximum flow problem: A max-preflow approach

Cited in

(3)

• An iterative security game for computing robust and adaptive network flows
• The unfortunate-flow problem
• Flow games

This page was built for publication: Playing with the Maximum-Flow Problem

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