


default search action
"An O(n^2.5) Algorithm for Maximum Matching in General Graphs"
Shimon Even, Oded Kariv (1975)
- Shimon Even, Oded Kariv:
An O(n^2.5) Algorithm for Maximum Matching in General Graphs. FOCS 1975: 100-112

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.