Improved FPT Algorithms for Deletion to Forest-Like Structures

Gowda, K.N., Lonkar, A., Panolan, F. orcid.org/0000-0001-6213-8687 et al. (2 more authors) (2024) Improved FPT Algorithms for Deletion to Forest-Like Structures. Algorithmica, 86. pp. 1657-1699. ISSN 0178-4617

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s00453-023-01206-z.

Keywords: Parameterized complexity; Independent feedback vertex set; Pseudo forest; Almost forest; Cut and count; Treewidth
Dates:
  • Published: May 2024
  • Published (online): 27 January 2024
  • Accepted: 29 December 2023
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 26 Jan 2024 10:54
Last Modified: 27 Jan 2025 01:13
Status: Published
Publisher: Springer
Identification Number: 10.1007/s00453-023-01206-z
Open Archives Initiative ID (OAI ID):

Export

Statistics