Shimon Even, Oded Kariv. An O(n^2.5) Algorithm for Maximum Matching in General Graphs. In 16th Annual Symposium on Foundations of Computer Science, 13-15 October, 1975, The University of California, Berkeley, CA, USA. pages 100-112, IEEE, 1975.
@inproceedings{EvenK75,
title = {An O(n^2.5) Algorithm for Maximum Matching in General Graphs},
author = {Shimon Even and Oded Kariv},
year = {1975},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/EvenK75},
cites = {0},
citedby = {0},
pages = {100-112},
booktitle = {16th Annual Symposium on Foundations of Computer Science, 13-15 October, 1975, The University of California, Berkeley, CA, USA},
publisher = {IEEE},
}