Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem
From MaRDI portal
Publication:1790957
DOI10.1007/978-3-319-94776-1_8OpenAlexW2809970489MaRDI QIDQ1790957
Uéverton S. Souza, Alan Diêgo Aurélio Carneiro, Fábio Protti
Publication date: 4 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-94776-1_8
knotFPTW[1-hardness]ETHdeadlock resolution
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
This page was built for publication: Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem
