A 4 k 2 kernel for feedback vertex set
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We prove that given an undirected graph G on n vertices and an integer k , one can compute, in polynomial time in n , a graph G′ with at most 4 k 2 vertices and an integer k′ such that G has a feedback vertex set of size at most k iff G′ has a feedback vertex set of size at most k′ . This result improves a previous O ( k 11 ) kernel of Burrage et al., and a more recent cubic kernel of Bodlaender. This problem was communicated by Fellows.
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
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428 · cited 2×
“Since the proof is based on maximum matching, by Edmonds’ classical matching algorithm [Edmonds 1965], it implies the existence of a polynomial algorithm which computes the maximum set of disjoint A-paths and the certificate X .”
Method
Cited by
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
Dell, H., & Van Melkebeek, D. (2014) · Journal of the ACM · doi:10.1145/2629620 · Cited by 159
Metadata
- Authors
- Thomassé, S.
- Venue
- ACM Transactions on Algorithms
- Published
- 2010-03
- Volume
- 6
- Issue
- 2
- Pages
- 1-8
- ISSN
- 1549-6325 (ISSN-L)
- 1549-6333
- OpenAlex
- W1974810008
- Cited by
- 194
- References
- 1
- FWCI
- 19.75
- 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.