Before revision:  A vertex v \in V is a twinless strong articulation point of G , if the deletion of v increases the number of TSCCs of G. Here, we present the first linear-time algorithm that finds all the twinless strong articulation points of a directed graph.
After revision:  A vertex v \in V is a twinless strong articulation point of G if the deletion of v increases the number of TSCCs of G. Here, we present the first linear-time algorithm that finds all the twinless strong articulation points of a directed graph.