On the Complexity of Singly Connected Vertex Deletion
From MaRDI portal
Publication:5041193
DOI10.1007/978-3-030-48966-3_18MaRDI QIDQ5041193
Saket Saurabh, Nidhi Purohit, Lawqueen Kanesh, Jayakrishnan Madathil, Avinandan Das, Komal Muluk
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-48966-3_18
tournaments; kernel; FPT algorithm; bounded independence number; local tournaments; singly connected digraphs