An Improved Exact Algorithm for Knot-Free Vertex Deletion

Ajaykrishnan E S, Soumen Maity, Abhishek Sahu +1

A knot $K$ in a directed graph $D$ is a strongly connected component of size at least two such that there is no arc $(u,v)$ with $u\in V(K)$ and $v\notin V(K)$. Given a directed g…