Advertisement

The Engineering of Some Bipartite Matching Programs

  • Kurt Mehlhorn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1741)

Abstract

Over the past years my research group was involved in the development of three algorithm libraries:
  • LEDA, a library of efficient data types and algorithms [LED]

  • CGAL, a computational geometry algorithms library [CGA], and

  • AGD, a library for automatic graph drawing [AGD].

Keywords

Bipartite Graph Match Algorithm Weighted Matchings Bipartite Match Initial Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ABMP91.
    H. Alt, N. Blum, K. Mehlhorn, and M. Paul. Computing a maximum cardinality matching in a bipartite graph in time O(n1:5pm=log n). Information Processing Letters, 37:237–240, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  2. AGD.
    The AGD graph drawing library. http://www.mpi-sb.mpg.de/AGD/.
  3. CGA.
    CGAL (Computational Geometry Algorithms Library). http://www.cs.ruu.nl/CGAL.
  4. CGM+97.
    B. Cherkassky, A. Goldberg, P. Martin, J. Setubal, and J. Stolfi. Augment or relabel? A computational study of bipartite matching and unit capacity maximum flow algorithms. Technical Report TR 97-127, NEC Research Institute, 1997.Google Scholar
  5. FF63.
    L.R. Ford and D.R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1963.Google Scholar
  6. HK73.
    J.E. Hopcroft and R.M. Karp. An n5=2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing, 2(4):225–231, 1973.zbMATHCrossRefMathSciNetGoogle Scholar
  7. LED.
    LEDA (Library of Efficient Data Types and Algorithms). http://www.mpi-sb.mpg.de/LEDA/leda.html.
  8. MN99.
    K. Mehlhorn and S. Näher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Kurt Mehlhorn
    • 1
  1. 1.Max-Planck-Institut fur InformatikIm StadtwaldGermany

Personalised recommendations