{"date_created":"2022-08-11T14:09:52Z","status":"public","page":"171–184","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Poutré, Han","first_name":"Han","last_name":"Poutré"}],"publisher":"Springer Nature","quality_controlled":"1","alternative_title":["LNCS"],"volume":979,"intvolume":"       979","citation":{"ieee":"M. Henzinger and H. Poutré, “Certificates and fast algorithms for biconnectivity in fully-dynamic graphs,” in <i>3rd Annual European Symposium on Algorithms</i>, Corfu, Greece, 1995, vol. 979, pp. 171–184.","apa":"Henzinger, M., &#38; Poutré, H. (1995). Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In <i>3rd Annual European Symposium on Algorithms</i> (Vol. 979, pp. 171–184). Corfu, Greece: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-60313-1_142\">https://doi.org/10.1007/3-540-60313-1_142</a>","mla":"Henzinger, Monika, and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.” <i>3rd Annual European Symposium on Algorithms</i>, vol. 979, Springer Nature, 1995, pp. 171–184, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_142\">10.1007/3-540-60313-1_142</a>.","short":"M. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms, Springer Nature, 1995, pp. 171–184.","ista":"Henzinger M, Poutré H. 1995. Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. 3rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 979, 171–184.","chicago":"Henzinger, Monika, and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.” In <i>3rd Annual European Symposium on Algorithms</i>, 979:171–184. Springer Nature, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_142\">https://doi.org/10.1007/3-540-60313-1_142</a>.","ama":"Henzinger M, Poutré H. Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In: <i>3rd Annual European Symposium on Algorithms</i>. Vol 979. Springer Nature; 1995:171–184. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_142\">10.1007/3-540-60313-1_142</a>"},"publication":"3rd Annual European Symposium on Algorithms","month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"1995-09-01T00:00:00Z","_id":"11805","day":"01","year":"1995","extern":"1","date_updated":"2024-11-06T12:16:15Z","abstract":[{"text":"In this paper, we present sparse certificates for biconnectivity together with algorithms for updating these certificates. We thus obtain fully-dynamic algorithms for biconnectivity in graphs that run in O(√n log n log⌈m/n⌉) amortized time per operation, where m is the number of edges and n is the number of nodes in the graph. This improves upon the results in [11], in which algorithms were presented running in O(√m) amortized time, and solves the open problem to find certificates to speed up biconnectivity, as stated in [2].","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1007/3-540-60313-1_142","title":"Certificates and fast algorithms for biconnectivity in fully-dynamic graphs","conference":{"name":"ESA: European Symposium on Algorithms","location":"Corfu, Greece","start_date":"1995-09-25","end_date":"1995-09-27"},"scopus_import":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783540603139"],"eisbn":["9783540449133"],"issn":["0302-9743"]},"oa_version":"None","type":"conference","publication_status":"published","article_processing_charge":"No"}