The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Maximum matching and a polyhedron with 0,1-vertices
Open accessAbstract
in a graph C is a subset of edges in C such that no two meet the same node in C. The convex polyhedron C is characterized, where the extreme points of C correspond to the matchings in C. Where each edge of C carries a real numerical weight, an efficient algorithm is described for finding a matching in C with maximum weight·sum.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Variants of the hungarian method for assignment problems
Kuhn, H. W. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030404 · Cited by 386
Cited by
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
Edmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
Self-citationComputationally Manageable Combinational Auctions
Rothkopf, M. H., Pekeč, A., & Harstad, R. M. (1998) · Management Science · doi:10.1287/mnsc.44.8.1131 · Cited by 1,024
Cones of Matrices and Set-Functions and 0–1 Optimization
Lovász, L., & Schrijver, A. (1991) · SIAM Journal on Optimization · doi:10.1137/0801013 · Cited by 1,008
Matching, Euler tours and the Chinese postman
Edmonds, J., & Johnson, E. L. (1973) · Mathematical Programming · doi:10.1007/bf01580113 · Cited by 980
Self-citationSherali, H. D., & Adams, W. P. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403036 · Cited by 931
State preservation by repetitive error detection in a superconducting quantum circuit
Kelly, J., Barends, R., Fowler, A. G., Megrant, A., Jeffrey, E., White, T. C., Sank, D., Mutus, J. Y., Campbell, B., Chen, Y., et al. (2015) · Nature · doi:10.1038/nature14270 · Cited by 916
Matroids and the greedy algorithm
Edmonds, J. (1971) · Mathematical Programming · doi:10.1007/bf01584082 · Cited by 866
Self-citationAn 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
Rivas, E., & Eddy, S. R. (1999) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.2436 · Cited by 754
Edmonds polytopes and a hierarchy of combinatorial problems
Chvátal, V. (1973) · Discrete Mathematics · doi:10.1016/0012-365x(73)90167-2 · Cited by 624
On the facial structure of set packing polyhedra
Padberg, M. W. (1973) · Mathematical Programming · doi:10.1007/bf01580121 · Cited by 596
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
“A pattern of chains of corrective operations highly likely to maintain the correct logical state can be inferred using Edmonds’ minimum weight perfect matching algorithm [21, 22, 23].”
MethodBlocking and anti-blocking pairs of polyhedra
Fulkerson, D. R. (1971) · Mathematical Programming · doi:10.1007/bf01584085 · Cited by 538
On maximal independent sets of vertices in claw-free graphs
Minty, G. J. (1980) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(80)90074-x · Cited by 463
Balas, E., & Padberg, M. W. (1976) · SIAM Review · doi:10.1137/1018115 · Cited by 449
Learning structured prediction models: a large margin approach
Taskar, B., Chatalbashev, V., Koller, D., & Guestrin, C. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102464 · Cited by 444
Blossom V: a new implementation of a minimum cost perfect matching algorithm
Kolmogorov, V. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-009-0002-8 · Cited by 414
Impact of Interference on Multi-Hop Wireless Network Performance
Jain, K., Padhye, J., Padmanabhan, V. N., & Qiu, L. (2005) · Wireless Networks · doi:10.1007/s11276-005-1769-9 · Cited by 404
Data structures for weighted matching and nearest common ancestors with linking
Gabow, H. N. (1990) · Symposium on Discrete Algorithms · doi:10.5555/320176.320229 · Cited by 398
Finding a Maximum Cut of a Planar Graph in Polynomial Time
Hadlock, F. (1975) · SIAM Journal on Computing · doi:10.1137/0204019 · Cited by 389
On the Problem of Discovering the Most Parsimonious Tree
Fitch, W. M. (1977) · The American Naturalist · doi:10.1086/283157 · Cited by 357
Surface code quantum computing with error rates over 1%
Wang, D. S., Fowler, A. G., & Hollenberg, L. C. L. (2011) · Physical Review A · doi:10.1103/physreva.83.020302 · Cited by 343
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Gabow, H. N. (1976) · Journal of the ACM · doi:10.1145/321941.321942 · Cited by 342
On network correlated data gathering
Cristescu, R., Beferull-Lozano, B., & Vetterli, M. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354677 · Cited by 334
Faster scaling algorithms for general graph matching problems
Gabow, H. N., & Tarjan, R. E. (1991) · Journal of the ACM · doi:10.1145/115234.115366 · Cited by 301
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
Matai, R., Singh, S., & Lal, M. (2010) · Traveling Salesman Problem, Theory and Applications · doi:10.5772/12909 · Cited by 299
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Crowder, H., & Padberg, M. W. (1980) · Management Science · doi:10.1287/mnsc.26.5.495 · Cited by 294
Image segmentation with ratio cut
Wang, S., & Siskind, J. M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1201819 · Cited by 293
Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile
Sbihi, N. (1980) · Discrete Mathematics · doi:10.1016/0012-365x(90)90287-r · Cited by 276
A fundamental problem in vehicle routing
Orloff, C. S. (1974) · Networks · doi:10.1002/net.3230040105 · Cited by 266
Linear-Time Approximation for Maximum Weight Matching
Duan, R., & Pettie, S. (2014) · Journal of the ACM · doi:10.1145/2529989 · Cited by 265
Sparse blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2025) · Quantum · doi:10.22331/q-2025-01-20-1600 · Cited by 180
Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code
Noh, K., & Chamberland, C. (2020) · Physical Review A · doi:10.1103/physreva.101.012316 · Cited by 164
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172
Constant overhead quantum fault tolerance with quantum expander codes
Fawzi, O., Grospellier, A., & Leverrier, A. (2021) · Communications of the ACM · doi:10.1145/3434163 · Cited by 111
Quantifying the Causal Effect of Individual Mobility on Health Status in Urban Space
Zhang, Y., Xu, F., Xia, T., & Li, Y. (2021) · Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies · doi:10.1145/3494990 · Cited by 68
Pipelined correlated minimum weight perfect matching of the surface code
Paler, A., & Fowler, A. G. (2023) · Quantum · doi:10.22331/q-2023-12-12-1205 · Cited by 22
Metadata
- Authors
- Edmonds, J.
- Venue
- Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics
- Published
- 1965-01
- Volume
- 69B
- Issue
- 1 and 2
- Pages
- 125
- ISSN
- 0022-4340 (ISSN-L)
- OpenAlex
- W2327315803
- Cited by
- 1,712
- References
- 1
- FWCI
- 1.72
- Type
- journal article
- Language
- en
- Open access
- hybrid
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
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.