A maximum flow algorithm using MA ordering.

DOI10.1016/S0167-6377(02)00237-7MaRDI QIDQ1811623zbMATH OpenOpenAlexFDO

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

Recommendations

• NEW MAXIMUM FLOW ALGORITHMS BY MA ORDERMGS AND SCALING
• PRACTICAL EFFICIENCY OF MAXIMUM FLOW ALGORITHMS USING MA ORDERINGS AND PREFLOWS
• The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
• A Fast and Simple Algorithm for the Maximum Flow Problem
• An o(n^3 )-Time Maximum-Flow Algorithm

Cites work

• Graph connectivity and its augmentation: Applications of MA orderings
• Network flows. Theory, algorithms, and applications.
• Theoretical Efficiency of the Algorithm “Capacity” for the Maximum Flow Problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(4)

• The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
• NEW MAXIMUM FLOW ALGORITHMS BY MA ORDERMGS AND SCALING
• PRACTICAL EFFICIENCY OF MAXIMUM FLOW ALGORITHMS USING MA ORDERINGS AND PREFLOWS

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

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