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

5 papers · 1 filter

cs.DS2020

Minimum $2$ -vertex strongly biconnected spanning directed subgraph problem

Raed Jaberi

A directed graph $G = (V, E)$ is strongly biconnected if $G$ is strongly connected and its underlying graph is biconnected. A strongly biconnected directed graph $G = (V, E)$ is called $…

cs.DS2020

$2$ -blocks in strongly biconnected directed graphs

Raed Jaberi

A directed graph $G = (V, E)$ is called strongly biconnected if $G$ is strongly connected and the underlying graph of $G$ is biconnected. A strongly biconnected component of a strongl…

cs.DS2020★ 2 cited

b-articulation points and b-bridges in strongly biconnected directed graphs

Raed Jaberi

A directed graph $G = (V, E)$ is called strongly biconnected if $G$ is strongly connected and the underlying graph of $G$ is biconnected. This class of directed graphs was first intro…

cs.DS2020

Minimum $2$ -vertex-twinless connected spanning subgraph problem

Raed Jaberi

Given a $2$ -vertex-twinless connected directed graph $G = (V, E)$ , the minimum $2$ -vertex-twinless connected spanning subgraph problem is to find a minimum cardinality edge subset $E^…

cs.DS2020★ 3 cited

$2$ -edge-twinless blocks

Raed Jaberi

Let $G = (V, E)$ be a directed graph. A $2$ -edge-twinless block in $G$ is a maximal vertex set $C^{t} \subseteq V$ with $∣ C^{t} ∣ > 1$ such that for any distinct vertices $v, w \in C^{t}$ ,…

Minimum 2-vertex strongly biconnected spanning directed subgraph problem

2-blocks in strongly biconnected directed graphs

b-articulation points and b-bridges in strongly biconnected directed graphs

Minimum 2-vertex-twinless connected spanning subgraph problem

2-edge-twinless blocks

Minimum $2$ -vertex strongly biconnected spanning directed subgraph problem

$2$ -blocks in strongly biconnected directed graphs

Minimum $2$ -vertex-twinless connected spanning subgraph problem

$2$ -edge-twinless blocks