Quick max-flow algorithm

DOI10.1007/S10852-008-9091-ZzbMATH Open1176.68144OpenAlexW1985325898MaRDI QIDQ841606FDOQ841606

Authors: 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

Recommendations

• A fast maximum flow algorithm
• A Fast and Simple Algorithm for the Maximum Flow Problem
• scientific article; zbMATH DE number 65738
• A Faster Deterministic Maximum Flow Algorithm
• scientific article; zbMATH DE number 742960
• scientific article; zbMATH DE number 634019
• scientific article; zbMATH DE number 5944649
• scientific article; zbMATH DE number 1187161
• Processor-efficient implementation of a maximum flow algorithm
• A Fast Parametric Maximum Flow Algorithm and Applications

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

• Maximal Flow Through a Network
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Title not available (Why is that?)
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks

Cited In (5)

• The in-out rebalancing flow method for maximum flow computation
• Method of calculating the maximum flow in network picture
• A new Karzanov-type \(O(n^ 3)\) max-flow algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)

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

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