Hopcroft, J.; Tarjan, R. (1973). Algorithm 447: efficient algorithms for graph manipulation. Communications of the ACM. 16 (6): 372—378. doi:10.1145/362248.362272.
Schmidt (2013), A Simple Test on 2-Vertex- and 2-Edge-Connectivity, Information Processing Letters, 113 (7): 241—244, doi:10.1016/j.ipl.2013.01.016.
Westbrook, J.; Tarjan, R. E. (1992). Maintaining bridge-connected and biconnected components on-line. Algorithmica. 7: 433—464. doi:10.1007/BF01758773.
Tarjan, R.; Vishkin, U. (1985). An Efficient Parallel Biconnectivity Algorithm. SIAM J. Comput.14 (4): 862—874. doi:10.1137/0214061.
Guojing Cong and David A. Bader, (2005). An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs). Proceedings of the 19th IEEE International Conference on Parallel and Distributed Processing Symposium. с. 45b. doi:10.1109/IPDPS.2005.100.{{cite conference}}: Обслуговування CS1: Сторінки з посиланнями на джерела із зайвою пунктуацією (посилання)
Edwards, J. A.; Vishkin, U. (2012). Better speedups using simpler parallel programming for graph connectivity and biconnectivity. Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores - PMAM '12. с. 103. doi:10.1145/2141702.2141714. ISBN9781450312110.
