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

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.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[3]  C. T. Zahn,et al.  Modification of Edmonds' maximum matching algorithm , 1965 .

[4]  H. Gabow.  An efficient implementation of Edmonds'' maximum matching algorithm. , 1972 .

[5]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

[6]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[7]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.