Efficient algorithms for finding maximum matching in graphs

  title={Efficient algorithms for finding maximum matching in graphs},
  author={Z. Galil},
  journal={ACM Comput. Surv.},
  • Z. Galil
  • Published 1986
  • Computer Science
  • ACM Comput. Surv.
  • This paper surveys the techniques used for designing the most efficient algorithms for finding a maximum cardinality or weighted matching in (general or bipartite) graphs. It also lists some open problems concerning possible improvements in existing algorithms and the existence of fast parallel algorithms for these problems. 

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Incremental assignment problem
    • 43
    • PDF
    A New Approach to Maximum Matching in General Graphs
    • 77
    • PDF
    A Self-Stabilizing Algorithm for Maximum Matching in Trees
    • 2
    in Interval Graphs
    • 14
    Computing Minimum-Weight Perfect Matchings
    • 234
    • PDF
    Finding the Maximum Matching in a Bipartite Graph
    • 3
    • PDF
    Parallel approximation algorithms for maximum weighted matching in general graphs
    • 40
    • PDF
    New Approximation Results on Graph Matching and related Problems
    • 9


    Publications referenced by this paper.
    Paths, Trees, and Flowers
    • 2,145
    • Highly Influential
    • PDF