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 …

The study of the Knot-Free Vertex Deletion problem emerges from its application in the
resolution of deadlocks called knots, detected in a classical distributed computation model …