The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Cited by
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Bodlaender, H. L. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539793251219 · Cited by 1,542
Complexity of Finding Embeddings in a k-Tree
Arnborg, S., Corneil, D. G., & Proskurowski, A. (1987) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0608024 · Cited by 1,206
Self-citationSimulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Metadata
- Authors
- Arnborg, S.
- Venue
- BIT
- Published
- 1985-03
- Volume
- 25
- Issue
- 1
- Pages
- 1-23
- ISSN
- 0006-3835 (ISSN-L)
- 1572-9125
- OpenAlex
- W2034501206
- Cited by
- 362
- References
- 1
- FWCI
- 3.89
- 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.
