Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp>

DOI10.1145/3155299zbMath1440.68139MaRDI QIDQ4554952

M. S. Ramanujan, Saket Saurabh, Daniel Lokshtanov

Publication date: 12 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3155299

zbMATH Keywords

feedback vertex set; graph separation problems; linear-time FPT algorithms

Mathematics Subject Classification ID

68W40: Analysis of algorithms

05C83: Graph minors

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms

68Q27: Parameterized complexity, tractability and kernelization