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 2019Show all

2 papers · 1 filter

cs.DS2019

Twinless articulation points and some related problems

Raed Jaberi

Let $G = (V, E)$ be a twinless strongly connected graph. a vertex $v \in V$ is a twinless articulation point if the subrgraph obtained from $G$ by removing the vertex $v$ is not twinle…

cs.DS2019★ 4 cited

Computing $2$ -twinless blocks

Raed Jaberi

Let $G = (V, E))$ be a directed graph. A $2$ -twinless block in $G$ is a maximal vertex set $B \subseteq V$ of size at least $2$ such that for each pair of distinct vertices $x, y \in B$ …

Twinless articulation points and some related problems

Computing 2-twinless blocks

Computing $2$ -twinless blocks