S. Alstrup, D. Harel, P. W. Lauridsen, and M. Thorup, Dominators in linear time, SIAM Journal on Computing, vol.28, issue.6, pp.2117-2149, 1999.

A. L. Buchsbaum, L. Georgiadis, H. Kaplan, A. Rogers, R. E. Tarjan et al., Linear-time algorithms for dominators and other path-evaluation problems, SIAM Journal on Computing, vol.38, issue.4, pp.1533-1573, 2008.

A. L. Buchsbaum, H. Kaplan, A. Rogers, and J. R. Westbrook, A new, simpler linear-time dominators algorithm, ACM Transactions on Programming Languages and Systems, vol.20, issue.6, pp.383-390, 1998.

W. Fraczak, L. Georgiadis, A. Miller, and R. E. Tarjan, Finding dominators via disjoint set union, Journal of Discrete Algorithms, vol.23, pp.2-20, 2013.

H. N. Gabow, The minset-poset approach to representations of graph connectivity. Unpublished manuscript, 2013.

L. Georgiadis, G. F. Italiano, L. Laura, and N. Parotsidis, 2-edge connectivity in directed graphs, Proc. 26th ACM-SIAM Symp. on Discrete Algorithms, 1988.

L. Georgiadis and R. E. Tarjan, Finding dominators revisited, Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, pp.862-871, 2004.

L. Georgiadis and R. E. Tarjan, Dominator tree certification and independent spanning trees. CoRR, abs/1210, vol.8303, 2012.

M. Henzinger, S. Krinninger, and V. Loitzenbauer, Finding 2-edge and 2-vertex strongly connected components in quadratic time, CoRR, 2014.

G. F. Italiano, L. Laura, and F. Santaroni, Finding strong bridges and strong articulation points in linear time, Theoretical Computer Science, vol.447, issue.0, pp.74-84, 2012.

R. Jaberi, Computing the 2-blocks of directed graphs. CoRR, abs/1407, vol.6178, 2014.

R. Jaberi, On computing the 2-vertex-connected components of directed graphs, 2014.

T. Lengauer and R. E. Tarjan, A fast algorithm for finding dominators in a flowgraph, ACM Transactions on Programming Languages and Systems, vol.1, issue.1, pp.121-162, 1979.

W. D. Luigi, L. Georgiadis, G. F. Italiano, L. Laura, and N. Parotsidis, 2-connectivity in directed graphs: An experimental study, Proc. 17th Wks. on Algorithm Engineering and Experiments, pp.173-187, 2015.

K. Menger, Zur allgemeinen kurventheorie, Fund. Math, vol.10, pp.96-115, 1927.

H. Nagamochi and T. Watanabe, Computing k-edge-connected components of a multigraph, IEICE Transactions on Fundamentals of Electronics, vol.76, issue.4, pp.513-517, 1993.

J. H. Reif and P. G. Spirakis, Strong k-connectivity in digraphs and random digraphs, 1981.

R. E. Tarjan, Depth-first search and linear graph algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.

R. E. Tarjan, Finding dominators in directed graphs, SIAM Journal on Computing, vol.3, issue.1, pp.62-89, 1974.

R. E. Tarjan, Efficiency of a good but not linear set union algorithm, Journal of the ACM, vol.22, issue.2, pp.215-225, 1975.

J. Westbrook and R. E. Tarjan, Maintaining bridge-connected and biconnected components on-line, Algorithmica, vol.7, issue.5&6, pp.433-464, 1992.