Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp>
DOI10.1145/3155299zbMath1440.68139OpenAlexW2781748924MaRDI QIDQ4554952
M. S. Ramanujan, Daniel Lokshtanov, Saket Saurabh
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
Analysis of algorithms (68W40) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (5)
This page was built for publication: Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp>