article Open access
Bivariate complexity analysis of Almost Forest Deletion
Ashutosh Raia✉, Saket Saurabha b
- aThe Institute of Mathematical Sciences, HBNI, Chennai, India
- bUniversity of Bergen, Bergen, Norway
- ✉Corresponding author
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRThis paper introduces the Almost Forest Deletion problem, where given a graph G and integers k and l, the question is whether there exists a subset of at most k vertices such that its deletion leaves us an l-forest. (Semantic Scholar)