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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1982 LNCS, Issue , 2001, Pages 23-38

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

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; DATA STRUCTURES;

GENERAL GRAPH; MATCHINGS; PRIORITY QUEUES; RUNNING TIME;

DATA STRUCTURES; ALGORITHMS;

EID: 84896693795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44691-5_3     Document Type: Conference Paper

References (17)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullmann. The design and analysis of computer algorithms. Addison-Wesley, 1974.
2. D. Applegate and W. Cook. Solving large-scale matching problems. In D. Johnson and C.C. McGeoch, editors, Network Flows and Matchings, Volume 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 557-576. American Mathematical Society, 1993.
3. B. Cherkassky and A. Goldberg. PRF, a Maxflow Code. www.intertrust.com/ star/goldberg/index.html.
4. W. Cook and A. Rohe. Computing minimum-weight perfect matchings. Technical Report 97863, Forschungsinstitut für Diskrete Mathematik, Universität Bonn, 1997.
5. U. Derigs and A. Metz. On the use of optimal fractional matchings for solving the (integer) matching problem. Mathematical Programming, 36:263-270, 1986.
6. U. Derigs and A. Metz. Solving (large scale) matching problems combinatorially. Mathematical Programming, 50:113-122, 1991.
7. M.B. Dillencourt. Toughness and delaunay triangulations. Discrete and Computational Geometry, 5:575-601, 1990.
8. J. Edmonds. Maximum matching and a polyhedron with (0,1) vertices. Journal of Research of the National Bureau of Standards, 69B:125-130, 1965.
9. J. Edmonds. Paths, trees, and flowers. Canadian Journal on Mathematics, pages 449-467, 1965.
10. H. N. Gabow. Implementation of algorithms for maximum matching and nonbi-partite graphs. PhD thesis, Stanford University, 1974.
11. H. N. Gabow. Data structures for weighted matching and nearest common ancestors with linking. In David Johnson, editor, Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90), pages 434-443, San Francisco, CA, USA, January 1990. SIAM.
12. 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. Computing, 15:120-130, 1986.
13. M. Humble. Implementierung von Flußalgorithmen mit dynamischen Bäumen. Master's thesis, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, 1996.
14. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, 1976.
15. K. Mehlhorn and S. Näher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages.
16. K. Mehlhorn. Data structures and algorithms. Volume 1: Sorting and searching, Volume 1 of EATCS monographs on theoretical computer science. Springer, 1984.
17. G. Schäfer. Weighted matchings in general graphs. Master's thesis, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, 2000.