The DOI matches its Crossref record; 3 of the 3 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.
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
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-citationEdmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
Self-citation
Cited by
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 3,132
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
A new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
Clark, B. N., Colbourn, C. J., & Johnson, D. S. (1990) · Discrete Mathematics · doi:10.1016/0012-365x(90)90358-o · Cited by 1,429
Complexity of vehicle routing and scheduling problems
Lenstra, J. K., & Kan, A. H. G. R. (1981) · Networks · doi:10.1002/net.3230110211 · Cited by 1,325
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Jonker, R., & Volgenant, A. (1987) · Computing · doi:10.1007/bf02278710 · Cited by 1,230
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
Efficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
Retiming synchronous circuitry
Leiserson, C. E., & Saxe, J. B. (1991) · Algorithmica · doi:10.1007/bf01759032 · Cited by 993
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Fast and robust Earth Mover's Distances
Pele, O., & Werman, M. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459199 · Cited by 805
Efficient identification of Web communities
Flake, G. W., Lawrence, S., & Giles, C. L. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347121 · Cited by 804
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
Optimal Matching for Observational Studies
Rosenbaum, P. R. (1989) · Journal of the American Statistical Association · doi:10.1080/01621459.1989.10478868 · Cited by 715
Suurballe, J. W. (1974) · Networks · doi:10.1002/net.3230040204 · Cited by 685
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
Stone, H. S. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.233840 · Cited by 680
The auction algorithm: A distributed relaxation method for the assignment problem
Bertsekas, D. P. (1988) · Annals of Operations Research · doi:10.1007/bf02186476 · Cited by 634
Social Media Mining: An Introduction
Zafarani, R., Abbasi, M. A., & Liu, H. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139088510 · Cited by 592
A new approach to the minimum cut problem
Karger, D. R., & Stein, C. (1996) · Journal of the ACM · doi:10.1145/234533.234534 · Cited by 485
There’s plenty of room at the Top: What will drive computer performance after Moore’s law?
Leiserson, C. E., Thompson, N. C., Emer, J. S., Kuszmaul, B. C., Lampson, B. W., Sanchez, D., & Schardl, T. B. (2020) · Science · doi:10.1126/science.aam9744 · Cited by 469
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
On the complexity of time table and multi-commodity flow problems
Even, S., Itai, A., & Shamir, A. (1975) · 16th Annual Symposium on Foundations of Computer Science (sfcs 1975) · doi:10.1109/sfcs.1975.21 · Cited by 431
Faster Scaling Algorithms for Network Problems
Gabow, H. N., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218069 · Cited by 414
Offloading in Internet of Vehicles: A Fog-Enabled Real-Time Traffic Management System
Wang, X., Ning, Z., & Wang, L. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2816590 · Cited by 398
A Note on Dijkstra's Shortest Path Algorithm
Johnson, D. B. (1973) · Journal of the ACM · doi:10.1145/321765.321768 · Cited by 380
On Implementing the Push—Relabel Method for the Maximum Flow Problem
Cherkassky, B. V., & Goldberg, A. V. (1997) · Algorithmica · doi:10.1007/pl00009180 · Cited by 370
Gallo, G., & Pallottino, S. (1988) · Annals of Operations Research · doi:10.1007/bf02288320 · Cited by 352
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Optimal Energy Aware Clustering in Sensor Networks
Ghiasi, S., Srivastava, A., Yang, X., & Sarrafzadeh, M. (2002) · Sensors · doi:10.3390/s20700258 · Cited by 339
A new approach to the maximum flow problem
Goldberg, A. V., & Tarjan, R. E. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12144 · Cited by 329
Max flows in O(nm) time, or better
Orlin, J. B. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488705 · Cited by 316
End-to-end capacities of a quantum communication network
Pirandola, S. (2019) · Communications Physics · doi:10.1038/s42005-019-0147-3 · Cited by 306
Imaging plant growth in 4D: robust tissue reconstruction and lineaging at cell resolution
Fernandez, R., Das, P., Mirabet, V., Moscardi, E., Traas, J., Verdeil, J.-L., Malandain, G., & Godin, C. (2010) · Nature Methods · doi:10.1038/nmeth.1472 · Cited by 305
Faster scaling algorithms for general graph matching problems
Gabow, H. N., & Tarjan, R. E. (1991) · Journal of the ACM · doi:10.1145/115234.115366 · Cited by 301
A new algorithm for the assignment problem
Bertsekas, D. P. (1981) · Mathematical Programming · doi:10.1007/bf01584237 · Cited by 292
Linear-Time Approximation for Maximum Weight Matching
Duan, R., & Pettie, S. (2014) · Journal of the ACM · doi:10.1145/2529989 · Cited by 265
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
Identifiability and experimental design in perturbation studies
Gross, T., & Blüthgen, N. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa404 · Cited by 11
Dynamically tuned push-relabel algorithm for the maximum flow problem on CPU-GPU-Hybrid platforms
He, Z., & Hong, B. (2010) · 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS) · doi:10.1109/ipdps.2010.5470401 · Cited by 4
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
- 3
- 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
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.