论文标题
最小双重连接跨越指导子图问题
Minimum strongly biconnected spanning directed subgraph problem
论文作者
论文摘要
令$ g =（v，e）$是一个强烈双连接的有向图。在本文中，我们考虑了计算最小尺寸的边缘子集$ h \ subseteq e $的问题，以使有向的子图$（v，h）$强烈地连接。
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.
