The DOI matches its Crossref record.
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.
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
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
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
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
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
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
- 0
- 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
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 matching and a polyhedron with 0,1-vertices. https://app.cochat.ai/papers/10.6028/jres.069b.013
- The paper
- Edmonds, J. (1965). Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics. https://doi.org/10.6028/jres.069b.013
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.
