Faster Fully-Dynamic Minimum Spanning Forest
Data Structures and Algorithms
2014-07-28 v1
Abstract
We give a new data structure for the fully-dynamic minimum spanning forest problem in simple graphs. Edge updates are supported in amortized time per operation, improving the amortized bound of Holm et al. (STOC'98, JACM'01). We assume the Word-RAM model with standard instructions.
Cite
@article{arxiv.1407.6832,
title = {Faster Fully-Dynamic Minimum Spanning Forest},
author = {Jacob Holm and Eva Rotenberg and Christian Wulff-Nilsen},
journal= {arXiv preprint arXiv:1407.6832},
year = {2014}
}
Comments
13 pages, 2 figures