The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Abstract
article Free Access Share on Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems Authors: Jack Edmonds Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, CanadaView Profile , Richard M. Karp College of Engineering, Operations Research Center, University of California, Berkeley, California College of Engineering, Operations Research Center, University of California, Berkeley, CaliforniaView Profile Authors Info & Claims Journal of the ACMVolume 19Issue 2April 1972 pp 248–264https://doi.org/10.1145/321694.321699Published:01 April 1972Publication History 1,682citation6,930DownloadsMetricsTotal Citations1,682Total Downloads6,930Last 12 Months607Last 6 weeks140 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Self-citation
Cited by
Warfield, S. K., Zou, K. H., & Wells, W. M. (2004) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2004.828354 · Cited by 2,072
Mugsy: Fast multiple alignment of closely related whole genomes
Angiuoli, S. V., & Salzberg, S. L. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btq665 · Cited by 444
Faster Scaling Algorithms for Network Problems
Gabow, H. N., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218069 · Cited by 414
A DTI-Derived Measure of Cortico-Cortical Connectivity
Zalesky, A., & Fornito, A. (2009) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2008.2012113 · Cited by 141
Ari, C., & Aksoy, S. (2010) · 2010 IEEE International Geoscience and Remote Sensing Symposium · doi:10.1109/igarss.2010.5653855 · Cited by 28
Metadata
- Authors
- Edmonds, J., & Karp, R. M.
- Venue
- Journal of the ACM
- Published
- 1972-04
- Volume
- 19
- Issue
- 2
- Pages
- 248-264
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2149342630
- Cited by
- 2,528
- References
- 1
- FWCI
- 11.15
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. https://app.cochat.ai/papers/10.1145/321694.321699
- The paper
- Edmonds, J., & Karp, R. M. (1972). Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of the ACM. https://doi.org/10.1145/321694.321699
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.
