On the complexity of singly connected vertex deletion
From MaRDI portal
Publication:2089067
DOI10.1016/j.tcs.2022.08.012MaRDI QIDQ2089067
Saket Saurabh, Nidhi Purohit, Lawqueen Kanesh, Jayakrishnan Madathil, Avinandan Das, Komal Muluk
Publication date: 6 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.08.012
tournaments; kernel; FPT algorithm; bounded independence number; local tournaments; singly connected digraphs
68Qxx: Theory of computing