Faster Scaling Algorithms for General Graph Matching Problems

Journal of the ACM (JACM)

Volumn 38, Issue 4, 1991, Pages 815-853

  Gabow, Harold N ^a   Tarjan, Robert E ^b,c  

^a UNIVERSITY OF COLORADO   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

augmenting path; blossoms matching; network optimisation; scaling

Indexed keywords

EID: 0000358314     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/115234.115366     Document Type: Article

References (30)

1. AHO. A. V., HOPCROFT, J. E., AND ULLMAN, J. D. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
2. BALL, M. O., AND DERIGS, U. An analysis of alternative strategies for implementing matching algorithms. Networks, 13 4 (1983), 517-549.
3. BERTSEKAS, D. P. Distributed asynchronous relaxation methods for linear network flow problems, LIDS Report P-1606, M.I.T., Cambridge, Mass., 1986; preliminary version. In Proceeding of the 25th Conference on Decision and Control. IEEE, New York, December 1986.
4. CHRISTOFIDES, N. Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon Univ., Pittsburgh, Pa., 1976.
5. CUNNINGHAM, W. H., AND MARSH, A. B. III. A primal algorithm for optimum matching. Math. Prog. Stud. 8 (1978), 50-72.
6. EDMONDS, J. Paths, trees and flowers. Canad. J. Math. 17 (1965), 449-467
7. EDMONDS. J. Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Nat. Bur. Standards 69B (1965), 125-130.
8. EDMONDS, J., AND KARP, R. M. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM, 19 0 (1972), 248-264.
9. GABOW, H. N. An efficient implementation of Edmonds’ algorithm for maximum matching on graphs. J. ACM 23, 2 (1976), 221-234.
10. GABOW, H. N. Scaling algorithms for network problems. J. Comp. and System Sci.,, 31 2 (1985), 148-168.
11. GABOW, H. N. A scaling algorithm for weighted matching on general graphs. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science. IEEE, New York, 1985, pp. 90-100.
12. GABOW, H. N. Duality and parallel algorithms for graph matching, manuscript.
13. GABOW. H. N. Data structures for weighted matching and nearest common ancestors with linking. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 1990. pp. 434-443.
14. GABOW, H. N., GALIL, Z., AND SPENCER, T. H. Efficient implementation of graph algorithms using contraction. J. ACM, 36 3 (1989), 540-572.
15. GABOW, H. N., AND TARJAN, R. E. A linear-time algorithm for a special case of disjoint set union. J. Comp. and System Sci.,, 30 2 (1985), 209-221.
16. GABOW, H. N., AND TARJAN, R. E. Algorithms for two bottleneck optimization problems. J. Algorithms,, 9 3 (1988), 411-417.
17. GABOW, H. N., AND TARJAN, R. E. Faster scaling algorithms for network problems. SIAM J. Comput.,, 18 5 (1989), 1013-1036.
18. GALIL, Z., MICALI, S., AND GABOW, H. N. An O(EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Comput.,, 15 1 (1986), 120-130.
19. GOLDBERG, A. V. Efficient graph algorithms for sequential and parallel computers. Ph. D. Dissertation. Dept. of Electrical Eng. and Comp. Sci., MIT, Technical Rep. MIT/LCS/TR-374, Cambridge, Mass., 1987.
20. GOLDBERG, A. V., AND TARJAN, R E. Finding minimum-cost circulations by successive approximation. Math. of Oper. Res.,, 15 3 (1990), 430-466.
21. HOPCROFT, J., AND KARP, R. An n5,2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput.,, 2 4 (1973), 225-231.
22. LAWLER, E. L. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, 1976.
23. LOVÁSZ., L., AND PLUMMER, M. D. Matching Theory North-Holland Mathematical Studies 121, Annals of Discrete Mathematics 29, North-Holland, New York, 1986.
24. MICALI. S., AND VAZIRANI, V V. An O[formula omitted] algorithm for finding maximum matching in general graphs. In Proceedings of the 21st Annual Symposium on the Foundations of Computer Science. IEEE. New York, 1980, pp. 17-27.
25. PAPADIMITRIOU, C. H., AND STEIGLITZ, K. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall. Inc, Englewood Cliffs, N.J., 1982.
26. TARDOS, É. A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5 3 (1985), 247-255.
27. TARJAN, R. E. Applications of path compression on balanced trees. J. ACM, 26 4 (1979), 690-715.
28. TARJAN, R. E. Data Structures and Network Algorithms. SIAM Monograph, Philadelphia, Pa., 1983.
29. VAIDYA, P. M. Geometry helps in matching In Proceeding of the 20th Annual ACM Symposium on Theory of Computing. ACM, New York, 1988, pp 422-425.
30. WEBER, G. M. Sensitivity analysis of optimal matchings, Networks 11 (1981), 41-56.