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
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.