Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms

ACM Journal of Experimental Algorithmics

Volumn 3, Issue , 1998, Pages 8-

  Cherkassky, Boris V ^a   Goldberg, Andrew V ^b   Martin, Paul ^b   Setubal, Joâo C ^c   Stolfi, Jorge ^c  

^a CENTRAL ECONOMICS AND MATHEMATICS INSTITUTE   (Russian Federation)

^b NEC LABORATORIES AMERICA   (United States)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70350640435     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/297096.297140     Document Type: Article

References (30)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993.
2. R. K. Ahuja, J. B. Orlin, C. Stein, and R. E. Tarjan. Improved Algorithms for Bipartite Network Flow. SIAM J. Comput., 23:906-933, 1994.
3. H. Alt, N. Blum, K. Mehlhorn, and M. Paul. Computing a Maximum Cardinality Matching in a Bipartite Graph in time [formula omitted]. Information Processing Let., 37:237-240, 1991.
4. R. J. Anderson and J. C. Setubal. Goldberg's Algorithm for the Maximum Flow in Perspective: a Computational Study. In D. S. Johnson and C. C. McGeoch, editors, Network Flows and Matching: First DIM ACS Implementation Challenge, pages 1-18. AMS, 1993.
5. S. F. Chang and S. T. McCormick. A Faster Implementation of a Bipartite Cardinality Matching Algorithm. Technical Report 90-MSC-005, Faculty of Commerce and Buisiness Administration, University of British Columbia, 1990.
6. J. Cheriyan and K. Mehlhorn. Algorithms for dense graphs and networks on the random access computer. Algorithmica, 15:521-549, 1996.
7. B. V. Cherkassky. A Fast Algorithm for Computing Maximum Flow in a Network. In A. V. Karzanov, editor, Collected Papers, Vol. 3: Combinatorial Methods for Flow Problems, pages 90-96. The Institute for Systems Studies, Moscow, 1979. In Russian. English translation appears in AMS Trans., Vol. 158, pp. 23-30, 1994.
8. B. V. Cherkassky and A. V. Goldberg. On Implementing Push-Relabel Method for the Maximum Flow Problem. Technical Report STAN-CS-94-1523, Department of Computer Science, Stanford University, 1994.
9. K. Darby-Dowman. The Exploration of Sparsity in Large Scale Linear Programming Problems-Data Structures and Restructuring Algorithms. PhD thesis, Brunei University, 1980.
10. U. Derigs and W. Meier. Implementing Goldberg's Max-Flow Algorithm - A Computational Investigation. ZOR - Methods and Models of Operations Research, 33:383-403, 1989.
11. U. Derigs and W. Meier. An Evaluation of Algorithmic Refinements and Proper Data-Structures for the Preflow-Push Approach for Maximum Flow. In ASI Series on Computer and System Sciences, volume 8, pages 209-223. NATO, 1992.
12. E. A. Dinic. Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation. Soviet Math. Dokl., 11:1277-1280, 1970.
13. S. Even and R. E. Tarjan. Network Flow and Testing Graph Connectivity. SIAM J. Comput., 4:507-518, 1975.
14. T. Feder and R. Motwani. Clique Partitions, Graph Compression and Speeding-up Algorithms. In Proc. 23rd Annual ACM Symposium on Theory of Computing, pages 123-133, 1991.
15. A. V. Goldberg. Efficient Graph Algorithms for Sequential and Parallel Computers. PhD thesis, M.I.T., January 1987. (Also available as Technical Report TR-374, Lab. for Computer Science, M.I.T., 1987).
16. A. V. Goldberg and R. Kennedy. Global Price Updates Help. Technical Report STAN-CS-94-1509, Department of Computer Science, Stanford University, 1994. To appear in SIAM J. on Discrete Math.
17. A. V. Goldberg and R. Kennedy. An Efficient Cost Scaling Algorithm for the Assignment Problem. Math. Prog., 71:153-178, 1995.
18. A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya. Sublinear-Time Parallel Algorithms for Matching and Related Problems. J. Algorithms, 14:180-213, 1993.
19. A. V. Goldberg and R. E. Tarjan. A New Approach to the Maximum Flow Problem. In Proc. 18th Annual ACM Symposium on Theory of Computing, pages 136-146, 1986.
20. A. V. Goldberg and R. E. Tarjan. A New Approach to the Maximum Flow Problem. J. Assoc. Comput. Mach., 35:921-940, 1988.
21. D. Goldfarb and M. D. Grigoriadis. A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow. Annals of Oper. Res., 13:83-123, 1988.
22. 2 Algorithm for Maximum Matching in Bipartite Graphs. SIAM J. Comput, 2:225-231, 1973.
23. A. V. Karzanov. O nakhozhdenii maksimal’nogo potoka v setyakh spetsial’nogo vida i nekoto-rykh prilozheniyakh. In Matematicheskie Voprosy Upravleniya Proizvodstvom, volume 5. Moscow State University Press, Moscow, 1973. In Russian; title translation: On Finding Maximum Flows in Networks with Special Structure and Some Applications.
24. A. V. Karzanov. Tochnaya otzenka algoritma nakhojdeniya maksimalnogo potoka, prime-nennogo k zadache “o predstavitelyakh”. In Problems in Cibernetics, volume 5, pages 66-70.
25. Nauka, Moscow, 1973. In Russian; title translation: The exact time bound for a maximum flow algorithm applied to the set representatives problem.
26. R. Kennedy. Solving Unweighted and Weighted Bipartite Matching Problems. PhD thesis, Stanford University, 1995.
27. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Reinhart, and Winston, New York, NY., 1976.
28. Q. C. Nguyen and V. Venkateswaran. Implementations of Goldberg-Tarjan Maximum Flow Algorithm. In D. S. Johnson and C. C. McGeoch, editors, Network Flows and Matching: First DIMACS Implementation Challenge, pages 19-42. AMS, 1993.
29. J. C. Setubal. New Experimental Results for Bipartite Matching. In Proceedings of net-FLOW93, pages 211-216. TR-21/93, Dipartimento di Informatica, Università di Pisa, 1993.
30. J. C. Setubal. Sequential and Parallel Experimental Results with Bipartite Matching Algorithms. Technical Report IC-96-09, Institute of Computing, University of Campinas, Brazil, 1996.