Computing 2-twinless blocks

Abstract: Let

G = (V, E))

be a directed graph. A

2

-twinless block in

G

is a maximal vertex set

B s u b s e t e q V

of size at least

2

such that for each pair of distinct vertices

x, y i n B

, and for each vertex

w i n V s e t m i n u s l e f t l b r a c e x, y i g h t b r a c e

, the vertices

x, y

are in the same twinless strongly connected component of

G s e t m i n u s l e f t l b r a c e w i g h t b r a c e

. In this paper we present algorithms for computing the

2

-twinless blocks of a directed graph.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Computing 2-twinless blocks