The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Matroids and the greedy algorithm
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
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Maximum matching and a polyhedron with 0,1-vertices
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.013 · Cited by 1,712
Self-citationEdmonds, J. (1967) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.071b.032 · Cited by 731
Self-citationOn the Abstract Properties of Linear Dependence
Whitney, H. (1935) · American Journal of Mathematics · doi:10.2307/2371182 · Cited by 713
On the Abstract Properties of Linear Dependence1
Whitney, H. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_5 · Cited by 653
Rosenstiehl, P. (1966) · HAL · Cited by 19
Cited by
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
The Traveling-Salesman Problem and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
Edmonds, J. (1967) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.071b.032 · Cited by 731
Self-citationMAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
Wainwright, M. J., Jaakkola, T. S., & Willsky, A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.856938 · Cited by 654
Blocking and anti-blocking pairs of polyhedra
Fulkerson, D. R. (1971) · Mathematical Programming · doi:10.1007/bf01584085 · Cited by 538
Roth, A. E., Sönmez, T., & Utku Ünver, M. (2005) · Journal of Economic Theory · doi:10.1016/j.jet.2005.04.004 · Cited by 536
A New Class of Upper Bounds on the Log Partition Function
Wainwright, M. J., Jaakkola, T. S., & Willsky, A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850091 · Cited by 381
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Machine interpretation of line drawings
(1987) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(87)80119-6 · Cited by 298
Degenerate Quantum LDPC Codes With Good Finite Length Performance
Panteleev, P., & Kalachev, G. (2021) · Quantum · doi:10.22331/q-2021-11-22-585 · Cited by 257
Metadata
- Authors
- Edmonds, J.
- Venue
- Mathematical Programming
- Published
- 1971-12
- Volume
- 1
- Issue
- 1
- Pages
- 127-136
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1991528957
- Cited by
- 866
- References
- 6
- FWCI
- 3.96
- Type
- journal article
- 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
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.