1. Alstrup S., Harel D., Lauridsen P.W. and Thorup M., Dominators in linear time.SIAM J. Comput.28(1999) 2117–2132.
2. R. Balakrishnan and K. Ranganathan, A Textbook of graph theory, 2nd edn. Springer (2012) 66.
3. Buchsbaum A.L., Georgiadis L., Kaplan H., Rogers A., Tarjan R.E. and Westbrook J.R., Linear-time algorithms for dominators and other path-evaluation problems.SIAM J. Comput.38(2008) 1533–1573.
4. J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark, k-Blocks, a connectivity invariant for graphs (2013). Preprint ArXiv:1305.4557.
5. Cheriyan J. and Thurimella R., Approximating minimum-size k-connected spanning subgraphs via matching.SIAM J. Comput.30(2000) 528–560.