The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Maximum Matchings via Gaussian Elimination
Abstract
We present randomized algorithms for finding maximum matchings in general and bipartite graphs. Both algorithms have running time O(n/sup w/), where w is the exponent of the best known matrix multiplication algorithm. Since w < 2.38, these algorithms break through the O(n/sup 2.5/) barrier for the matching problem. They both have a very simple implementation in time O(n/sup 3/) and the only non-trivial element of the O(n/sup w/) bipartite matching algorithm is the fast matrix multiplication algorithm. Our results resolve a long-standing open question of whether Lovasz's randomized technique of testing graphs for perfect matching in time O(n/sup w/) can be extended to an algorithm that actually constructs a perfect matching.
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
Combinatorial optimization. Polyhedra and efficiency.
Schrijver, A. (2003) · UvA-DARE (University of Amsterdam) · Cited by 3,045
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Schwartz, J. T. (1980) · Journal of the ACM · doi:10.1145/322217.322225 · Cited by 1,701
Edmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
Probabilistic algorithms for sparse polynomials
Zippel, R. (1979) · Lecture Notes in Computer Science · doi:10.1007/3-540-09519-5_73 · Cited by 1,101
The Factorization of Linear Graphs
Tutte, W. T. (1947) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-22.2.107 · Cited by 920
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
Micali, S., & Vazirani, V. V. (1980) · 21st Annual Symposium on Foundations of Computer Science (sfcs 1980) · doi:10.1109/sfcs.1980.12 · Cited by 822
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28396 · Cited by 632
Triangular Factorization and Inversion by Fast Matrix Multiplication
Bunch, J. R., & Hopcroft, J. E. (1974) · Mathematics of Computation · doi:10.1090/s0025-5718-1974-0331751-8 · Cited by 353
Cited by
Linear-Time Approximation for Maximum Weight Matching
Duan, R., & Pettie, S. (2014) · Journal of the ACM · doi:10.1145/2529989 · Cited by 265
Metadata
- Authors
- Mucha, M., & Sankowski, P.
- Venue
- 45th Annual IEEE Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 2004-12-23
- Pages
- 248-255
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W1494735819
- Cited by
- 268
- References
- 16
- FWCI
- 7.51
- 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: Maximum Matchings via Gaussian Elimination. https://app.cochat.ai/papers/10.1109/focs.2004.40
- The paper
- Mucha, M., & Sankowski, P. (2004). Maximum Matchings via Gaussian Elimination. 45th Annual IEEE Symposium on Foundations of Computer Science. https://doi.org/10.1109/focs.2004.40
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.