On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem
From MaRDI portal
Publication:2078619
DOI10.1016/j.tcs.2022.01.031MaRDI QIDQ2078619
Fábio Protti, Uéverton dos Santos Souza, Alan Diêgo Aurélio Carneiro
Publication date: 1 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.031
knot; FPT; W[1-hard]; ETH; deadlock resolution
68Qxx: Theory of computing