View of On the minimum number of inversions to make a digraph k-(arc-)strong | European Conference on Combinatorics, Graph Theory and Applications