Data structures for weighted matching and nearest common ancestors with linking

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1990, Pages 434-443

  Gabow, Harold N ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

BIPARTITE GRAPHS; GENERAL GRAPH; WEIGHTED MATCHING;

GRAPH THEORY;

EID: 85030568489     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. [AMOT] R. K. Ahuja, K. Melhorn, J. B. Orlin and R. E. Tarjan, "Faster algorithms for the shortest path problem", Technical Rept. No. 193, Operations Research Center, MIT, Cambridge, Mass., 1988.
2. [BD] M. O. Ball and U. Derigs, "An analysis of alternative strategies for implementing matching algorithms", Networks 13, 4, 1983, pp. 517-549.
3. [C] B. Chazelle, "Computing on a free tree via complexity-preserving mappings", Algorithmica, 2, 1987, pp. 337-361.
4. [CM] W. H. Cunningham and A. B. Marsh, III, "A primal algorithm for optimum matching", Math. Programming Study 8, 1978, pp. 50-72.
5. [E] J. Edmonds, "Maximum matching and a polyhedron with 0, 1-vertices", J. Res. Nat. Bur. Standards 69 B, 1965, pp. 125-130.
6. [FS] M. L. Fredman and M. E. Saks, "The cell probe complexity of dynamic data structures", Proc. 21st Annual ACM Symp. on Theory of Comp., 1989, pp. 345-354.
7. [FT] M. L. Fredman and R. E. Tarjan, "Fibonacci heaps and their uses in improved network optimization algorithms", J. ACM, 34, 3, 1987, pp. 596-615.
8. [G73] H. N. Gabow, "Implementations of algorithms for maximum matching on nonbipartite graphs", Ph. D. Dissertation, Comp. Sci. Dept., Stanford Univ., Stanford, Calif., 1973.
9. [G85a] H. N. Gabow, "Scaling algorithms for network problems", J. Comp. and System Sci., 31, 2, 1985, pp. 148-168.
10. [G85b] H. N. Gabow, "A scaling algorithm for weighted matching on general graphs", Proc. 26th Annual Symp. on Found, of Comp. Sci., 1985, pp. 90-100.
11. [GGS] H. N. Gabow, Z. Galil and T. H. Spencer, "Efficient implementation of graph algorithms using contraction", J. ACM, 36, 3, 1989, pp. 540-572.
12. [GGST] H. N. Gabow, Z. Galil, T. H. Spencer and R. E. Tarjan, "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs", Combinatorica 6, 2, 1986, pp. 109-122.
13. [GMG] Z. Galil, S. Micali and H. N. Gabow, "An O (EV log V) algorithm for finding a maximal weighted matching in general graphs", SIAM J. Comput, 15, 1, 1986, pp. 120-130.
14. [GS] H. N. Gabow and M. Stallmann, "Efficient algorithms for graphic matroid intersection and parity", Automata, Languages and Programming: 12th Colloquium, Lecture Notes in Computer Science 194, W. Brauer, ed., Springer-Verlag, 1985, pp. 210-220.
15. [GT85] H. N. Gabow and R. E. Tarjan, "A linear-time algorithm for a special case of disjoint set union", J. Comp. and System Sci., 30, 2, 1985, pp. 209-221.
16. [GT89] H. N. Gabow and R. E. Tarjan, "Faster scaling algorithms for general graph matching problems", submitted.
17. [GW] H. N. Gabow and H. H. Westermann, "Forests, frames and games: algorithms for matroid sums and applications", Proc. 20th Annual ACM Symp. on Theory of Comp., 1988, pp. 407-421; submitted.
18. [GX] H. N. Gabow and Y. Xu, "Efficient algorithms for independent assignment on graphic and linear matroids", Proc. 30th Annual Symp. on Found, of Comp. Sci., 1989, to appear.
19. [H] D. Harel, "A linear time algorithm for finding dominators in flow graphs and related problems", Proc. 17th Annual ACM Symp. on Theory of Comp., 1985, pp. 185-194.
20. [HT] D. Harel and R. E. Tarjan, "Fast algorithms for finding nearest common ancestors", SIAM J. Comput., 13, 2, 1984, pp. 338-355.
21. [K55] H. W. Kuhn, "The Hungarian method for the assignment problem", Naval Res. Logist. Quart., 2, 1955, pp. 83-97.
22. [K56] H. W. Kuhn, "Variants of the Hungarian method for assignment problems", Naval Res. Logist. Quart., 3, 1956, pp. 253-258.
23. [L] E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
24. [LP] L. Lovasz and M. D. Plummer, Matching Theory, North-Holland Mathematic Studies 121, North-Holland, New York, 1986.
25. [PS] C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1982.
26. [SIT] D. D. Sleator and R. E. Tarjan, "A data structure for dynamic trees", J. Comp. and System Sci., 26, 1983, pp. 362-391.
27. [SuT] J. W. Suurballe and R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths", Networks 14, 1984, pp. 325-336.
28. [SV] B. Schieber and U. Vishkin, "On finding lowest common ancestors: simplification and parallelization", SIAM J. Comput., 17, 6, 1988, pp. 1253-1262.
29. [T79] R. E. Tarjan, "Applications of path compression on balanced trees", J. ACM, 26, 4, 1979, pp. 690-715.
30. [T82] R. E. Tarjan, "Sensitivity analysis of minimum spanning trees and shortest path trees", Inf. Proc. Letters, 14, 1, 1982, pp. 30-32.
31. [T83] R. E. Tarjan, Data Structures and Network Algorithms, SIAM, Philadelphia, PA., 1983.
32. [TV] R. E. Tarjan and U. Vishkin, "An efficient parallel biconnectivity algorithm", SIAM J. Comput., 14, 4, 1985, pp. 862-874.
33. [W] G-M. Weber, "Sensitivity analysis of optimal matchings", Networks 11, 1981, pp. 41-56.