# Computing 2-twinless blocks

Let G=(V,E)) be a directed graph. A 2-twinless block in G is a maximal vertex set B⊆ V of size at least 2 such that for each pair of distinct vertices x,y ∈ B, and for each vertex w∈ V∖ x,y, the vertices x,y are in the same twinless strongly connected component of G∖ w. In this paper we present an algorithm for computing the 2-twinless blocks of G in O(n^3) time.

READ FULL TEXT