Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
1 Publication
1995 | Conference Paper | IST-REx-ID: 11805
Henzinger, Monika H., and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.” 3rd Annual European Symposium on Algorithms, vol. 979, Springer Nature, 1995, pp. 171–184, doi:10.1007/3-540-60313-1_142.
View
| DOI