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

Authors:
S. Even;O. Kariv
Affiliations:
-;-
Venue:
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Year:
1975

Citing 0
Cited 6

Reductions among high dimensional proximity problems

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Tight Bounds for Wavelength Assignment on Trees of Rings

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Incremental assignment problem

Information Sciences: an International Journal
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems

IEEE Transactions on Computers
Linear CNF formulas and satisfiability

Discrete Applied Mathematics
On linear CNF formulas

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

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.