Quick max-flow algorithm

DOI10.1007/s10852-008-9091-zzbMath1176.68144OpenAlexW1985325898MaRDI QIDQ841606

Przemysław Gordinowicz

Publication date: 18 September 2009

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-008-9091-z

zbMATH Keywords

network flows maximum flow discrete optimization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Maximal Flow Through a Network
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: Quick max-flow algorithm