A fast maximum flow algorithm

DOI10.1002/net.22001zbMath1528.05030arXiv1910.04848OpenAlexW3107976745MaRDI QIDQ6065305

James B. Orlin, Unnamed Author

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.04848

zbMATH Keywords

contractionnetwork flowsmaximum flowsstrongly polynomialscaling algorithmsflow-return forest

Mathematics Subject Classification ID

Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• A data structure for dynamic trees
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A Fast and Simple Algorithm for the Maximum Flow Problem
• Beyond the flow decomposition barrier
• Maximal Flow Through a Network
• A new approach to the maximum-flow problem
• Improved Time Bounds for the Maximum Flow Problem
• A Faster Deterministic Maximum Flow Algorithm
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Max flows in O(nm) time, or better

This page was built for publication: A fast maximum flow algorithm