Raed Jaberi

activity

20192024

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

2 citations · 2 across the 4 of their papers we have counts for

collaborators

5 papers

cs.DS2024

The problem of computing a $2$ -T-connected spanning subgraph with minimum number of edges in directed graphs

Raed Jaberi, Reham Mansour

Let $G = (V, E)$ be a strongly connected graph with $∣ V ∣ \geq 3$ . For $T \subseteq V$ , the strongly connected graph $G$ is $2$ -T-connected if $G$ is $2$ -edge-connected and for each vert…

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

The problem of computing a 2-T-connected spanning subgraph with minimum number of edges in directed graphs

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

Twinless articulation points and some related problems

The problem of computing a $2$ -T-connected spanning subgraph with minimum number of edges in directed graphs

$2$ -blocks in strongly biconnected directed graphs

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