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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

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...
01/05/2018

Sparse highly connected spanning subgraphs in dense directed graphs

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

Parameterized Complexity of Min-Power Asymmetric Connectivity

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

Large Graph Exploration via Subgraph Discovery and Decomposition

We are developing an interactive graph exploration system called Graph P...
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 𝒮𝒯...
11/11/2020

An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph

In the weighted minimum strongly connected spanning subgraph (WMSCSS) pr...
01/23/2018

Signal Subgraph Estimation Via Vertex Screening

Graph classification and regression have wide applications in a variety ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.