# Minimum 2-edge strongly biconnected spanning directed subgraph problem

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 connected and the underlying undirected graph of G is biconnected. A strongly biconnected directed graph G=(V,E) is said to be 2- edge strongly biconnected if it has at least three vertices and the directed subgraph (V,E∖{ e} ) is strongly biconnected for all e ∈ E. Let G=(V,E) be a 2-edge-strongly biconnected directed graph. In this paper we study the problem of computing a minimum size subset H ⊆ E such that the directed subgraph (V,H) is 2- edge strongly biconnected.

research
07/09/2022

### Minimum strongly biconnected spanning directed subgraph problem

Let G=(V,E) be a strongly biconnected directed graph. In this paper we c...
research
08/02/2020

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

A directed graph G=(V,E) is strongly biconnected if G is strongly connec...
research
07/03/2020

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

A directed graph G=(V,E) is called strongly biconnected if G is strongly...
research
10/01/2022

### An experimental study of algorithms for obtaining a singly connected subgraph

A directed graph G = (V,E) is singly connected if for any two vertice...
research
11/27/2019

### Roundtrip Spanners with (2k-1) Stretch

A roundtrip spanner of a directed graph G is a subgraph of G preserving ...
research
01/27/2020

### The game of Cops and Robbers on directed graphs with forbidden subgraphs

The traditional game of cops and robbers is played on undirected graph. ...
research
08/30/2021

### BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs

Edge-coloured directed graphs provide an essential structure for modelli...