The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs

Raed Jaberi, Reham Mansour

Let $G=(V,E)$ be a strongly connected graph with $|V|\ge 3$. For $T\subseteq V$, the strongly connected graph $G$ is $2$-T-connected if $G$ is $2$-edge-connected and for each vert…