The DOI matches its Crossref record.
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.
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
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
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
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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A simple min-cut algorithm. https://app.cochat.ai/papers/10.1145/263867.263872
- The paper
- Stoer, M., & Wagner, F. (1997). A simple min-cut algorithm. Journal of the ACM. https://doi.org/10.1145/263867.263872
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.
