Implementation of O(nm log n) weighted matchings in general graphs: The power of data structures

ACM Journal of Experimental Algorithmics

Volumn 7, Issue , 2002, Pages

  Mehlhorn, Kurt ^a   Schäfer, Guido ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70349869794     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/944618.944622     Document Type: Article

References (18)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMANN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley.
2. APPLEGATE, D. AND COOK, W. 1993. Solving large-scale matching problems. In D. JOHNSON AND C. MCGEOCH Eds., Network Flows and Matchings, Volume 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 557-576. American Mathematical Society.
3. CHERKASSKY, B. AND GOLDBERG, A. PRF, a Maxflow Code, www.intertrust.com/star/goldberg/index.html.
4. COOK, W. AND ROHE, A. 1997. Computing minimum-weight perfect matchings. Technical Report 97863, Forschungsinstitut für Diskrete Mathematik, Universität Bonn.
5. DERIGS, U. AND METZ, A. 1986. On the use of optimal fractional matchings for solving the (integer) matching problem. Mathematical Programming 36, 263-270.
6. DERIGS, U. AND METZ, A. 1991. Solving (large scale) matching problems combinatorially. Mathematical Programming 50, 113-122.
7. DILLENCOURT, M. B. 1990. Toughness and delaunay triangulations. Discrete and Computational Geometry 5, 575-601.
8. EDMONDS, J. 1965a. Maximum matching and a polyhedron with (0,1) vertices. Journal of Research of the National Bureau of Standards 69B, 125-130.
9. EDMONDS, J. 1965b. Paths, trees, and flowers. Canadian Journal on Mathematics 17, 449-467.
10. GABOW, H. N. 1974. Implementation of Algorithms for Maximum Matching and Nonbipartite Graphs. Ph. D. thesis, Stanford University.
11. st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90) (San Francisco, CA, USA, January 1990), pp. 434-443. SIAM.
12. GALIL, Z., MICALI, S., AND GABOW, H. N. 1986. An O(EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Computing 15, 120-130.
13. HUMBLE, M. 1996. Implementierung von Flußalgorithmen mit dynamischen Bäumen. Master's thesis, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken.
14. LAWLER, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
15. MEHLHORN, K. 1984. Data Structures and Algorithms. Sorting and Searching, Volume 1 of EATCS monographs on theoretical computer science. Springer.
16. MEHLHORN, K. AND NÄHER, S. 1999. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press. 1018 pages.
17. th Annual European Symposium on Algorithms, Volume 2161 of Lecture Notes in Computer Science (2001), pp. 242-253. Springer.
18. SCHÄFER, G. 2000. Weighted matchings in general graphs. Master's thesis, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken.