Identifying a 3-vertex strongly biconnected directed subgraph with minimum number of edges
Data Structures and Algorithms
2022-11-29 v1 Combinatorics
Abstract
A strongly connected graph is strongly biconnected if after ignoring the direction of its edges we have an undirected graph with no articulation points. A 3-vertex strongly biconnected graph is a strongly biconnected digraph that has the property that deleting any two vertices in this graph leaves a strongly binconnected subgraph. Jaberi [11] presented approximation algorithms for minimum cardinality 2-vertex strongly biconnected directed subgraph problem. We will focus in this paper on polynomial time algorithms which we have implemented for producing spanning subgraphs that are 3-vertex strongly biconnected.
Keywords
Cite
@article{arxiv.2211.14572,
title = {Identifying a 3-vertex strongly biconnected directed subgraph with minimum number of edges},
author = {Azzam Habib},
journal= {arXiv preprint arXiv:2211.14572},
year = {2022}
}