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/log logn) 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 nlogloglogn/log logn). We assume the Word-RAM model with standard instructions.
Cite
CITATION STYLE
Holm, J., Rotenberg, E., & Wulff-Nilsen, C. (2015). Faster Fully-Dynamic minimum spanning forest. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9294, pp. 742–753). Springer Verlag. https://doi.org/10.1007/978-3-662-48350-3_62
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
