The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A simple min-cut algorithm
Open accessAbstract
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implement, and has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm known. The runtime analysis is straightforward. In contrast to nearly all approaches so far, the algorithm uses no flow techniques. Roughly speaking, the algorithm consists of about | V | nearly identical phases each of which is a maximum adjacency search .
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
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
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
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (1956) · Canadian Journal of Mathematics · doi:10.4153/cjm-1956-045-5 · Cited by 2,410
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
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_15 · Cited by 1,829
The LEDA platform for combinatorial and geometric computing
Mehlhorn, K., Näher, S., & Uhrig, C. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_161 · Cited by 1,199
Cited by
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Near linear time algorithm to detect community structures in large-scale networks
Raghavan, U. N., Albert, R., & Kumara, S. (2007) · Physical Review E · doi:10.1103/physreve.76.036106 · Cited by 3,502
A survey of mobile cloud computing: architecture, applications, and approaches
Dinh, H. T., Lee, C., Niyato, D., & Wang, P. (2013) · Wireless Communications and Mobile Computing · doi:10.1002/wcm.1203 · Cited by 2,391
Performance of modularity maximization in practical contexts
Good, B. H., de Montjoye, Y.-A., & Clauset, A. (2010) · Physical Review E · doi:10.1103/physreve.81.046106 · Cited by 937
Hamilton, W. L. (2020) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01588-5 · Cited by 607
Consistency of spectral clustering
von Luxburg, U., Belkin, M., & Bousquet, O. (2008) · The Annals of Statistics · doi:10.1214/009053607000000640 · Cited by 540
Mining coherent dense subgraphs across massive biological networks for functional discovery
Hu, H., Yan, X., Huang, Y., Han, J., & Zhou, X. J. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1049 · Cited by 333
Hamilton, W. L. (2020) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s01045ed1v01y202009aim046 · Cited by 320
Secure Control Systems: A Quantitative Risk Management Approach
(2015) · IEEE Control Systems · doi:10.1109/mcs.2014.2364709 · Cited by 316
“rithms can be direct [62], or based on solving the dual maximum”
BackgroundAdaptive Offloading for Pervasive Computing
Gu, X., Messer, A., Greenberg, I., Milojicic, D., & Nahrstedt, K. (2004) · IEEE Pervasive Computing · doi:10.1109/mprv.2004.1321031 · Cited by 263
An Efficient Application Partitioning Algorithm in Mobile Environments
Wu, H., Knottenbelt, W. J., & Wolter, K. (2019) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2019.2891695 · Cited by 125
Metadata
- Authors
- Stoer, M., & Wagner, F.
- Venue
- Journal of the ACM
- Published
- 1997-07
- Volume
- 44
- Issue
- 4
- Pages
- 585-591
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2057463094
- Cited by
- 736
- References
- 6
- FWCI
- 5.57
- Type
- journal article
- Language
- en
- Open access
- bronze
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.