The DOI matches its Crossref record.
Finding approximate separators and computing tree width quickly
Open accessAbstract
We show that for any fixed k, there is a linear-time algorithm which given a graph G either: (i) finds a cutset X of G with |X| ≤ k such that no component of G–X contains more than 3/4|G–X| vertices, or (ii) determines that for any set X of vertices of G with |X| ≤ k, there is a component of G–X which contains more than 2/3|G–X| vertices.
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
Parameterized Complexity and Approximation Algorithms
Marx, D. (2007) · The Computer Journal · doi:10.1093/comjnl/bxm048 · Cited by 283
Efficient Solution Algorithms for Factored MDPs
Guestrin, C., Koller, D., Parr, R., & Venkataraman, S. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1000 · Cited by 169
Metadata
- Authors
- Reed, B. A.
- Venue
- Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92
- Publisher
- ACM Press
- Published
- 1992
- Pages
- 221-228
- OpenAlex
- W2151617868
- Cited by
- 179
- References
- 0
- FWCI
- 9.55
- Type
- conference paper
- 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: Finding approximate separators and computing tree width quickly. https://app.cochat.ai/papers/10.1145/129712.129734
- The paper
- Reed, B. A. (1992). Finding approximate separators and computing tree width quickly. Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92. https://doi.org/10.1145/129712.129734
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.