The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Matching, Euler tours and the Chinese postman
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
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Self-citationMaximum 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. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
Self-citationThe Theory of Graphs and Its Applications
Burger, E., Berge, C., & Doig, A. (1965) · Econometrica · doi:10.2307/1911908 · Cited by 897
The Theory of Graphs and its Applications.
Harary, F., & Berge, C. (1963) · Biometrika · doi:10.2307/2333777 · Cited by 598
Solutio problematis ad geometriam situs pertinentis
Euler, L. (n.d.) · Scholarly Commons (University of the Pacific) · Cited by 363
Matching: A Well-Solved Class of Integer Linear Programs
Edmonds, J., & Johnson, E. L. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36478-1_3 · Cited by 129
Self-citation
Cited by
Assembly of long, error-prone reads using repeat graphs
Kolmogorov, M., Yuan, J., Lin, Y., & Pevzner, P. A. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0072-8 · Cited by 5,986
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
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
Principles and methods of testing finite state machines-a survey
Lee, D., & Yannakakis, M. (1996) · Proceedings of the IEEE · doi:10.1109/5.533956 · Cited by 1,228
Integer and combinatorial optimization
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91259-2 · Cited by 1,117
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
DNA rendering of polyhedral meshes at the nanoscale
Benson, E., Mohammed, A., Gardell, J., Masich, S., Czeizler, E., Orponen, P., & Högberg, B. (2015) · Nature · doi:10.1038/nature14586 · Cited by 672
Faster Scaling Algorithms for Network Problems
Gabow, H. N., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218069 · Cited by 414
Mega-scale fabrication by Contour Crafting
Khoshnevis, B., Hwang, D., Yao, K. T., & Yeh, Z. (2006) · International Journal of Industrial and Systems Engineering · doi:10.1504/ijise.2006.009791 · Cited by 378
Wong, L. L., Phuah, K. C., Dai, R., Chen, H., Chew, W. S., & Adams, S. (2021) · Chemistry of Materials · doi:10.1021/acs.chemmater.0c03893 · Cited by 303
Computational Complexity of Discrete Optimization Problems
Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70821-5 · Cited by 292
ProjecToR: Agile Reconfigurable Data Center Interconnect
Ghobadi, M., Mahajan, R., Phanishayee, A., Devanur, N., Kulkarni, J., Ranade, G., Blanche, P.-A., Rastegarfar, H., Glick, M., & Kilper, D. (2016) · Proceedings of the 2016 ACM SIGCOMM Conference · doi:10.1145/2934872.2934911 · Cited by 286
A fundamental problem in vehicle routing
Orloff, C. S. (1974) · Networks · doi:10.1002/net.3230040105 · Cited by 266
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
Fusion Blossom: Fast MWPM Decoders for QEC
Wu, Y., & Zhong, L. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00107 · Cited by 47
Application of Basic Graph Theory in Autonomous Motion of Robots
Coufal, P., Hubálovský, Š., & Hubálovská, M. (2021) · Mathematics · doi:10.3390/math9090919 · Cited by 9
Fault-tolerant quantum speedup from constant depth quantum circuits
Mezher, R., Ghalbouni, J., Dgheim, J., & Markham, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033444 · Cited by 8
Metadata
- Authors
- Edmonds, J., & Johnson, E. L.
- Venue
- Mathematical Programming
- Published
- 1973-12
- Volume
- 5
- Issue
- 1
- Pages
- 88-124
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2064284095
- Cited by
- 980
- References
- 8
- FWCI
- 7.31
- 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.