@techreport{TR-DCC-93-03,
  number = {DCC-93-03},
  author = {Baier Saip, Herbert A. and Lucchesi, Cláudio L.},
  title = {Matching Algorithms for Bipartite Graphs},
  month = {March},
  year = {1993}, 
  institution = {Department of Computer Science, University of Campinas},
  note = {In English, 18 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      The matching problem in graphs consists in determining matchings,
      that is, vertex disjoint sets of edges of the graph.  In
      particular, we are interested in finding maximum matchings, that
      is, matchings of maximum cardinality.  There are many variations
      around this problem, the graph can be: bipartite or not, weighted
      or not.
    \par
      In this work we describe briefly the most important algorithms for
      solving the problem of maximum matching, weighted or not, in
      bipartite graphs.  At the end of the article we give a table which
      describes briefly the most important algorithms for solving the
      general problem, in which the graph is not necessarily bipartite.
  }
}