Dominators in linear time, SIAM Journal on Computing, vol.28, issue.6, pp.2117-2149, 1999. ,

Linear-time algorithms for dominators and other path-evaluation problems, SIAM Journal on Computing, vol.38, issue.4, pp.1533-1573, 2008. ,

A new, simpler linear-time dominators algorithm, ACM Transactions on Programming Languages and Systems, vol.20, issue.6, pp.383-390, 1998. ,

Finding dominators via disjoint set union, Journal of Discrete Algorithms, vol.23, pp.2-20, 2013. ,

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

2-edge connectivity in directed graphs, Proc. 26th ACM-SIAM Symp. on Discrete Algorithms, 1988. ,

Finding dominators revisited, Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, pp.862-871, 2004. ,

Dominator tree certification and independent spanning trees. CoRR, abs/1210, vol.8303, 2012. ,

Finding 2-edge and 2-vertex strongly connected components in quadratic time, CoRR, 2014. ,

Finding strong bridges and strong articulation points in linear time, Theoretical Computer Science, vol.447, issue.0, pp.74-84, 2012. ,

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

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

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

2-connectivity in directed graphs: An experimental study, Proc. 17th Wks. on Algorithm Engineering and Experiments, pp.173-187, 2015. ,

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

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

Strong k-connectivity in digraphs and random digraphs, 1981. ,

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

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

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

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