Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Balancing applied to maximum network flow problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
About preflow algorithms for the minimum flow problem
WSEAS Transactions on Computer Research
Sequential and parallel deficit scaling algorithms for minimum flow in bipartite networks
WSEAS Transactions on Computers
A parallel algorithm for the minimum flow problem in bipartite networks
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
The wave preflow algorithm for the minimum flow problem
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
About flow problems in networks with node capacities
WSEAS Transactions on Computers
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
Operations Research Letters
Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm
Computers and Industrial Engineering
| Hi-index | 0.00 |
Maximum adjacency (MA) ordering has effectively been applied to graph connectivity problems by Nagamochi and Ibaraki. In this note we show an application of MA ordering to the maximum flow problem with integral capacities to get a new polynomial-time algorithm. A scaling version of our algorithm runs in O(mnlogU) time, where m is the number of arcs, n the number of vertices, and U the maximum capacity.