Efficient Computation of Edge-Resilient Strongly Orientable Blocks in Mixed Graphs

Given a mixed graph G, we can efficiently compute its maximal sets of vertices C1, C2, ..., Ck such that for every i and every edge e of G, there is an orientation of G \ e where all vertices in Ci are strongly connected.