Minimum 2-vertex strongly biconnected spanning directed subgraph problem

08/02/2020
by   Raed Jaberi, et al.
0

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 2-vertex-strongly biconnected if |V|≥ 3 and the induced subgraph on V∖{ w} is strongly biconnected for every vertex w∈ V. In this paper we study the following problem. Given a 2-vertex-strongly biconnected directed graph G=(V,E), compute an edge subset E^2sb⊆ E of minimum size such that the subgraph (V,E^2sb) is 2-vertex-strongly biconnected.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2022

Minimum 2-edge strongly biconnected spanning directed subgraph problem

Wu and Grumbach introduced the concept of strongly biconnected directed ...
research
11/26/2022

Identifying a 3-vertex strongly biconnected directed subgraph with minimum number of edges

A strongly connected graph is strongly biconnected if after ignoring the...
research
05/29/2020

Parameterized Complexity of Min-Power Asymmetric Connectivity

We investigate parameterized algorithms for the NP-hard problem Min-Powe...
research
08/13/2018

Large Graph Exploration via Subgraph Discovery and Decomposition

We are developing an interactive graph exploration system called Graph P...
research
09/08/2020

Self-Stabilizing Construction of a Minimal Weakly 𝒮𝒯-Reachable Directed Acyclic Graph

We propose a self-stabilizing algorithm to construct a minimal weakly 𝒮𝒯...
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
01/05/2018

Sparse highly connected spanning subgraphs in dense directed graphs

Mader (1985) proved that every strongly k-connected n-vertex digraph con...

Please sign up or login with your details

Forgot password? Click here to reset