Minimum strongly biconnected spanning directed subgraph problem
Data Structures and Algorithms
2022-07-12 v1
Authors:
Raed Jaberi
Abstract
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.
Keywords
Cite
@article{arxiv.2207.04321,
title = {Minimum strongly biconnected spanning directed subgraph problem},
author = {Raed Jaberi},
journal= {arXiv preprint arXiv:2207.04321},
year = {2022}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
Minimum $2$-edge strongly biconnected spanning directed subgraph problem
Raed Jaberi
2022-07-21
Data Structures and Algorithms · Computer Science
Minimum $2$-vertex strongly biconnected spanning directed subgraph problem
Raed Jaberi
2022-05-10
Data Structures and Algorithms · Computer Science
Minimum $2$-vertex-twinless connected spanning subgraph problem
Raed Jaberi
2020-01-14
Data Structures and Algorithms · Computer Science
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
2015-09-10
Data Structures and Algorithms · Computer Science
$2$-blocks in strongly biconnected directed graphs
Raed Jaberi
2020-07-21
Data Structures and Algorithms · Computer Science
An experimental study of algorithms for obtaining a singly connected subgraph
Ahmed Zahloote, Al-hasan Saleh, Ayman Ghanem, Hiba Hasan +6
2022-11-29
Data Structures and Algorithms · Computer Science
The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
Raed Jaberi, Reham Mansour
2024-10-01
Data Structures and Algorithms · Computer Science
Identifying a 3-vertex strongly biconnected directed subgraph with minimum number of edges
Azzam Habib
2022-11-29
Data Structures and Algorithms · Computer Science
b-articulation points and b-bridges in strongly biconnected directed graphs
Raed Jaberi
2020-07-07
Discrete Mathematics · Computer Science
Minimum Labelling bi-Connectivity
Jose' Andres Moreno Perez, Sergio Consoli
2018-07-03
Data Structures and Algorithms · Computer Science
On 2-strong connectivity orientations of mixed graphs and related problems
Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas
2024-04-15
Data Structures and Algorithms · Computer Science
A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
Ali Çivril
2024-07-16
Combinatorics · Mathematics
Two-connected spanning subgraphs with at most $\frac{10}{7}$OPT edges
Klaus Heeger, Jens Vygen
2016-09-20
Data Structures and Algorithms · Computer Science
1.85 Approximation for Min-Power Strong Connectivity
Gruia Calinescu
2012-05-16
Data Structures and Algorithms · Computer Science
Strong Connectivity in Directed Graphs under Failures, with Application
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2019-05-08
Discrete Mathematics · Computer Science
On the Minimum Spanning Tree for Directed Graphs with Potential Weights
V. A. Buslov, V. A. Khudobakhshov
2008-01-16
Discrete Mathematics · Computer Science
Making Bidirected Graphs Strongly Connected
Tatsuya Matsuoka, Shun Sato
2017-09-05
Data Structures and Algorithms · Computer Science
Improved Approximation for Two-Edge-Connectivity
Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli
2022-11-15
Combinatorics · Mathematics
Decomposing Weighted Graphs
Amir Ban
2017-02-02
Data Structures and Algorithms · Computer Science
Twinless articulation points and some related problems
Raed Jaberi
2019-12-30
Data Structures and Algorithms · Computer Science
Finding Densest $k$-Connected Subgraphs
Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2021-10-26
Data Structures and Algorithms · Computer Science
On Strongly Connected Digraphs with Bounded Cycle Length
Samir Khuller, Balaji Raghavachari, Neal Young
2015-06-02
Combinatorics · Mathematics
On the Random Minimum Spanning Subgraph Problem for Hypergraphs
Nikita Zvonkov
2024-05-31
Data Structures and Algorithms · Computer Science
On finding highly connected spanning subgraphs
Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017-01-12
Social and Information Networks · Computer Science
To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano, Francesco Gullo +1
2017-09-06