Abstract
We give a new data structure for the fully-dynamic minimum spanning forest problem in simple graphs. Edge updates are supported in O(log4 n/loglogn) expected amortized time per operation, improving the O(log4 n) amortized bound of Holm et al. (STOC ’98, JACM ’01). We also provide a deterministic data structure with amortized update time O(log4 n logloglogn/loglogn). We assume the Word-RAM model with standard instructions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1(2), 243–264 (2005)
Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? Journal of Computer and System Sciences 57(1), 74–93 (1998), See also STOC 1995
Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM 44(5), 669–696 (1997)
Frederickson, G.N.: Data structures for on-line updating of minimum spanning trees, with applications. SIAM Journal on Computing 14(4), 781–798 (1985), See also STOC 1983
Han, Y.: Deterministic sorting in O(nloglogn) time and linear space. J. Algorithms 50(1), 96–105 (2004), See also STOC 2002
Henzinger, M.R., King, V.: Fully dynamic 2-edge connectivity algorithm in polylogarithmic time per operation (1997)
Henzinger, M.R., King, V.: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46(4), 502–516 (1999), See also STOC 1995
Henzinger, M.R., Thorup, M.: Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms 11(4), 369–379 (1997), See also ICALP 1996
Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4), 723–760 (2001), See also STOC 1998
Pǎtraşcu, M., Demaine, E.D.: Lower bounds for dynamic connectivity. In: Proc. 36th ACM Symposium on Theory of Computing (STOC), pp. 546–553 (2004)
Raman, R.: Fast algorithms for shortest paths and sorting (1996)
Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proc. 32nd ACM Symposium on Theory of Computing (STOC), pp. 343–350 (2000)
Thorup, M.: Randomized sorting in O(nloglogn) time and linear space using addition, shift, and bit-wise boolean operations. J. Algorithms 42(2), 205–230 (2002), See also SODA 1997
Wulff-Nilsen, C.: Faster deterministic fully-dynamic graph connectivity. In: SODA, pp. 1757–1769 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holm, J., Rotenberg, E., Wulff-Nilsen, C. (2015). Faster Fully-Dynamic Minimum Spanning Forest. In: Bansal, N., Finocchi, I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science(), vol 9294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48350-3_62
Download citation
DOI: https://doi.org/10.1007/978-3-662-48350-3_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48349-7
Online ISBN: 978-3-662-48350-3
eBook Packages: Computer ScienceComputer Science (R0)