Abstract
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].
Maiden name: Monika H. Rauch. This research was supported in part by the NSF Career Award 27813.
Full name: Johannes A. La Poutré. The research of the author has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences (KNAW).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Cheriyan and R. Thurimella, “Algorithms for parallel k-vertex connectivity and sparse certificates” Proc. 23rd Annual Symp. on Theory of Computing, 1991, 391–401.
D. Eppstein, Z. Galil, G. F. Italiano, A. Nissenzweig, “Sparsification — A technique for speeding up dynamic graph algorithms” Proc. 33nd Annual Symp. on Foundations of Computer Science, 1992, 60–69.
D. Eppstein, Z. Galil, G. F. Italiano, and T. Spencer. “Separator based sparsification for dynamic planar graph algorithms”. Proc. 25th Annual Symp. on Theory of Computing, 1993, 208–217.
G. N. Frederickson, “Data Structures for On-line Updating of Minimum Spanning Trees” SIAM J. Comput. 14 (1985), 781–798.
G. N. Frederickson, “Ambivalent Data Structures for Dynamic 2-edge-connectivity and k smallest spanning trees” Proc. 32nd Annual IEEE Symp. on Foundation of Comput. Sci., 1991, 632–641.
M.H. Rauch Henzinger and V. King, “Randomized Dynamic Graph Algorithms with Polylogarithmic Time per Operation” Proc. 27th Annual Symp. on Theory of Computing, 1995, 519–527.
J.A. La Poutré, “Dynamic Graph Algorithms and Data Structures” Ph.D. Thesis, Utrecht University, 1991.
J.A. La Poutré, “Alpha-Algorithms for Incremental Planarity Testing” Proc. 26 Annual Symp. on Theory of Computing, 1994, 706–715.
J.A. La Poutré and J. Westbrook, “Dynamic Two-Connectivity with Backtracking” Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, 1994, 204–212.
M. H. Rauch. “Fully Dynamic Biconnectivity in Graphs” Proc. 33nd Annual Symp. on Foundations of Computer Science, 1992, 50–59.
M. H. Rauch. “Improved Data Structures for Fully Dynamic Biconnectivity” Proc. 26 Annual Symp. on Theory of Computing, 1994, 686–695. An improved version is published as Technical Report 94-1412, Department of Computer Science, Cornell University, Ithaca, NY.
J. Westbrook, R. E. Tarjan, “Maintaining bridge-connected and biconnected components on-line” Algorithmica 7 (1992), 433–464.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Henzinger, M.R., La Poutré, H. (1995). Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_142
Download citation
DOI: https://doi.org/10.1007/3-540-60313-1_142
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60313-9
Online ISBN: 978-3-540-44913-3
eBook Packages: Springer Book Archive