• DocumentCode
    2176775
  • Title

    An O (N2.5) algorithm for maximum matching in general graphs

  • Author

    Even, S. ; Kariv, O.

  • fYear
    1975
  • fDate
    13-15 Oct. 1975
  • Firstpage
    100
  • Lastpage
    112
  • Abstract
    This work presents a new efficient algorithm for finding a maximum matching in an arbitrary graph. Two implementations are suggested, the complexity of the first is O(n2.5) and the complexity of the second is O(m√n¿log n) where n, m are the numbers of the vertices and the edges in the graph.
  • Keywords
    Bipartite graph; Circuits; Data structures; Law; Lead; Legal factors; Terminology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1975., 16th Annual Symposium on
  • Conference_Location
    USA
  • ISSN
    0272-5428
  • Type

    conf

  • DOI
    10.1109/SFCS.1975.5
  • Filename
    4567865
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2176775