Raed Jaberi

activity

20142026

2

-vertex-connected components of directed graphs

7 citations · 16 across the 12 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

cs.DS2014

On testing single connectedness in directed graphs and some related problems

Martin Dietzfelbinger, Raed Jaberi

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 \in V$ there is at most one simple pat…

cs.DS2014

Computing the $2$ -blocks of directed graphs

Raed Jaberi

Let $G$ be a directed graph. A \textit{ $2$ -directed block} in $G$ is a maximal vertex set $C^{2 d} \subseteq V$ with $∣ C^{2 d} ∣ \geq 2$ such that for each pair of distinct vertices $x,…

cs.DS2014★ 7 cited

On computing the $2$ -vertex-connected components of directed graphs

Raed Jaberi

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 fi…

On testing single connectedness in directed graphs and some related problems

Computing the 2-blocks of directed graphs

On computing the 2-vertex-connected components of directed graphs

Computing the $2$ -blocks of directed graphs

On computing the $2$ -vertex-connected components of directed graphs