Minimum strongly biconnected spanning directed subgraph problem

TL;DR

This paper investigates the problem of finding the smallest subset of edges in a strongly biconnected directed graph that maintains strong biconnectivity, addressing an optimization challenge in graph theory.

Contribution

It introduces the minimum strongly biconnected spanning subgraph problem and analyzes methods to compute such minimal edge subsets.

Findings

Formulation of the minimum strongly biconnected spanning subgraph problem

Theoretical insights into the complexity of the problem

Potential algorithms or approaches for solving the problem

Abstract

Let $G=(V,E)$ be a strongly biconnected directed graph. In this paper we consider the problem of computing an edge subset $H \subseteq E$ of minimum size such that the directed subgraph $(V,H)$ is strongly biconnected.