In this paper we consider the problem of computing the 2-vertex-connected components (2-vccs) of directed graphs. We present two new algorithms for solving this problem. The first algorithm runs inâ€¦ (More)

Let G be a directed graph. A 2-directed block in G is a maximal vertex set C âŠ† V with |C2d| â‰¥ 2 such that for each pair of distinct vertices x, y âˆˆ C, there exist two vertex-disjoint paths from x toâ€¦ (More)

Let G = (V,E) be a directed graph with n vertices and m edges. The graph G is called singly-connected if for each pair of vertices v,w âˆˆ V there is at most one simple path from v to w in G. Buchsbaumâ€¦ (More)