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.