The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
An O (N2.5) algorithm for maximum matching in general graphs
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Edmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
The Theory of Graphs and Its Applications
Burger, E., Berge, C., & Doig, A. (1965) · Econometrica · doi:10.2307/1911908 · Cited by 897
Berge, C. (1957) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.43.9.842 · Cited by 567
Cited by
Scheduling subject to resource constraints: classification and complexity
Blazewicz, J., Lenstra, J. K., & Kan, A. H. G. R. (1983) · Discrete Applied Mathematics · doi:10.1016/0166-218x(83)90012-4 · Cited by 1,436
Fast probabilistic algorithms for hamiltonian circuits and matchings
Angluin, D., & Valiant, L. G. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90045-x · Cited by 570
Maximum Matchings via Gaussian Elimination
Mucha, M., & Sankowski, P. (2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.40 · Cited by 268
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Metadata
- Authors
- Even, S., & Kariv, O.
- Venue
- 16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
- Publisher
- IEEE
- Published
- 1975-10
- Pages
- 100-112
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2065295938
- Cited by
- 287
- References
- 6
- FWCI
- 5.54
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An O (N2.5) algorithm for maximum matching in general graphs. https://app.cochat.ai/papers/10.1109/sfcs.1975.5
- The paper
- Even, S., & Kariv, O. (1975). An O (N2.5) algorithm for maximum matching in general graphs. 16th Annual Symposium on Foundations of Computer Science (sfcs 1975). https://doi.org/10.1109/sfcs.1975.5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.