Henzinger, Monika H., and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.”10.1007/3-540-60313-1_142__3rd Annual European Symposium on Algorithms, vol. 979, Springer Nature, 1995, pp. 171–184, doi:10.1007/3-540-60313-1_142.
LibreCat: https://research-explorer.ista.ac.at/record/11805
DOI: 10.1007/3-540-60313-1_142