The {\it inversion} of a set $X$ of vertices in a digraph $D$ consists of reversing the direction of all arcs of $D\langle X\rangle$. We study $sinv'_k(D)$ (resp. $sinv_k(D)$) which is the minimum number of inversions needed to transform $D$ into a $k$-arc-strong (resp. $k$-strong) digraph and $sinv'_k(n) = \max\{sinv'_k(D) \mid D~\mbox{is a $2k$-edge-connected digraph of order $n$}\}$. We show : $(i): \frac{1}{2} \log (n - k+1) \leq sinv'_k(n) \leq \log n + 4k -3$ ; $(ii):$ for any fixed positive integers $k$ and $t$, deciding whether a given oriented graph $\vec{G}$ satisfies $sinv'_k(\vec{G}) \leq t$ (resp. $sinv_k(\vec{G}) \leq t$) is NP-complete ; $(iii):$ if $T$ is a tournament of order at least $2k+1$, then $sinv'_k(T) \leq sinv_k(T) \leq 2k$, and $sinv'_k(T) \leq \frac{4}{3}k+o(k)$; $(iv):\frac{1}{2}\log(2k+1) \leq sinv'_k(T) \leq sinv_k(T)$ for some tournament $T$ of order $2k+1$; $(v):$ if $T$ is a tournament of order at least $19k-2$ (resp. $11k-2$), then $sinv'_k(T) \leq sinv_k(T) \leq 1$ (resp. $sinv_k(T) \leq 3$); $(vi):$ for every $\epsilon>0$, there exists $C$ such that $sinv'_k(T) \leq sinv_k(T) \leq C$ for every tournament $T$ on at least $2k+1 + \epsilon k$ vertices.

翻译：有向图$D$中顶点子集$X$的{\it 反转}定义为反转$D\langle X\rangle$中所有弧的方向。我们研究$sinv'_k(D)$（分别地，$sinv_k(D)$），即将$D$转化为$k$-弧强连通（分别地，$k$-强连通）有向图所需的最小反转次数，并定义$sinv'_k(n) = \max\{sinv'_k(D) \mid D~\mbox{为$n$阶$2k$-边连通有向图}\}$。我们证明：$(i): \frac{1}{2} \log (n - k+1) \leq sinv'_k(n) \leq \log n + 4k -3$；$(ii):$ 对任意固定正整数$k$和$t$，判定给定定向图$\vec{G}$是否满足$sinv'_k(\vec{G}) \leq t$（分别地，$sinv_k(\vec{G}) \leq t$）是NP完全的；$(iii):$ 若$T$是阶数至少为$2k+1$的竞赛图，则$sinv'_k(T) \leq sinv_k(T) \leq 2k$，且$sinv'_k(T) \leq \frac{4}{3}k+o(k)$；$(iv):$ 存在阶数为$2k+1$的竞赛图$T$使得$\frac{1}{2}\log(2k+1) \leq sinv'_k(T) \leq sinv_k(T)$；$(v):$ 若$T$是阶数至少为$19k-2$（分别地，$11k-2$）的竞赛图，则$sinv'_k(T) \leq sinv_k(T) \leq 1$（分别地，$sinv_k(T) \leq 3$）；$(vi):$ 对任意$\epsilon>0$，存在常数$C$使得对每个顶点数至少为$2k+1 + \epsilon k$的竞赛图$T$，有$sinv'_k(T) \leq sinv_k(T) \leq C$。