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 cs.DSShow all

14 papers · 1 filter

cs.DS2026

Problems related to strong connectivity and strong biconnectivity

Raed Jaberi

Let $G = (V, E)$ be a strong biconnected graph and let $B \subseteq V$ such that for each vertex $w \in B$ , the subgraph $G ∖ {w}$ is strongly connected. In this…

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

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

Raed Jaberi

Wu and Grumbach introduced the concept of strongly biconnected directed graphs. A directed graph $G = (V, E)$ is called strongly biconnected if the directed graph $G$ is strongly conn…

cs.DS2022

Minimum strongly biconnected spanning directed subgraph problem

Raed Jaberi

Let $G = (V, E)$ be a strongly biconnected directed graph. In this paper we consider the problem of computing an edge subset $H \subseteq E$ of minimum size such that the directed sub…

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}$ ,…

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

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…

Problems related to strong connectivity and strong biconnectivity

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

Minimum 2-edge strongly biconnected spanning directed subgraph problem

Minimum strongly biconnected spanning directed subgraph problem

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

Twinless articulation points and some related problems

Computing 2-twinless blocks

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

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

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

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

Computing $2$ -twinless blocks

Computing the $2$ -blocks of directed graphs

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