Abstract
We propose a data structure for maintaining 2-edge connectivity information dynamically in a planar graph. The data structure requires linear storage and preprocessing time for its construction, supports online updates (insertion and deletion of an edge) in O(log2 n) time, and answers a query (whether two vertices are in the same 2-connected component) in O(log n) time. The previous best algorithm for this problem required O(log3 n) time for updates.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, Reading, MA, 1974.
D. Eppstein, G. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung. “Maintenance of a minimum spanning forest in a dynamic planar graph” Proc. of 1st SODA, 1990.
G. N. Frederickson. “Data structures for online updating of minimum spanning trees.” SIAM J. on Computing (14), 1985, 781–798.
G. N. Frederickson. “Ambivalent data structures for dynamic 2-edge connectivity and k smallest spanning trees.” Proc. of 32nd FOCS, 1991.
Z. Galil and G. Italiano. “Fully dynamic algorithms for edge connectivity problems.” Proc. of 23rd STOC, 1991.
F. Harary. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1969.
J. H. Hopcroft and R. E. Tarjan. “Dividing a graph into tri-connected components.” SIAM J. on Computing, 1973.
G. L. Miller and V. Ramachandran. “A new graph triconnectivity algorithm and its parallelization.” Proc. 19th STOC, 1987.
R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, 1983.
R. E. Tarjan. “Depth-first search and linear graph algorithms.” SIAM J. on Computing, 1972.
R. E. Tarjan and U. Vishkin. “An efficient parallel biconnectivity algorithm.” SIAM J. of Computing, pp. 862–874, 1985.
J. Westbrook and R. E. Tarjan. “Maintaining bridge-connected and bi-connected components on-line.” Tech Report, Princeton University, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hershberger, J., Rauch, M., Suri, S. (1992). Fully dynamic 2-edge-connectivity in planar graphs. In: Nurmi, O., Ukkonen, E. (eds) Algorithm Theory — SWAT '92. SWAT 1992. Lecture Notes in Computer Science, vol 621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55706-7_20
Download citation
DOI: https://doi.org/10.1007/3-540-55706-7_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55706-7
Online ISBN: 978-3-540-47275-9
eBook Packages: Springer Book Archive