A maximum flow algorithm using MA ordering.

DOI10.1016/S0167-6377(02)00237-7zbMath1046.90097OpenAlexW2043663800MaRDI QIDQ1811623

Satoru Fujishige

Publication date: 17 June 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00237-7

zbMATH Keywords

MA orderingMaximum flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ The MA-ordering max-flow algorithm is not strongly polynomial for directed networks

Cites Work

• Unnamed Item
• Graph connectivity and its augmentation: Applications of MA orderings
• Theoretical Efficiency of the Algorithm “Capacity” for the Maximum Flow Problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: A maximum flow algorithm using MA ordering.