An improved FPT algorithm for independent feedback vertex set

DOI10.1007/978-3-030-00256-5_28zbMath1506.68082arXiv1803.00937OpenAlexW2963525463MaRDI QIDQ5915594

Marcin Pilipczuk, Shao-hua Li

Publication date: 22 November 2018

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.00937

zbMATH Keywords

FPT algorithmindependent feedback vertex set

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (4)

Improved FPT Algorithms for Deletion to Forest-Like Structures. ⋮ Minimization and parameterized variants of vertex partition problems on graphs ⋮ Approximability of the independent feedback vertex set problem for bipartite graphs ⋮ An improved FPT algorithm for independent feedback vertex set

This page was built for publication: An improved FPT algorithm for independent feedback vertex set