Minimum strongly biconnected spanning directed subgraph problem

07/09/2022
by   Raed Jaberi, et al.
0

Let G=(V,E) be a strongly biconnected directed graph. In this paper we consider the problem of computing an edge subset H ⊆ E of minimum size such that the directed subgraph (V,H) is 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
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
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...
research
10/14/2022

Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem

Jaberi [7] presented approximation algorithms for the problem of computi...
research
04/10/2020

The giant component of the directed configuration model revisited

We prove a law of large numbers for the order and size of the largest st...
research
10/31/2019

A poset metric from the directed maximum common edge subgraph

We study the directed maximum common edge subgraph problem (DMCES) for d...
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 𝒮𝒯...

Please sign up or login with your details

Forgot password? Click here to reset