We give a new data structure for the fully-dynamic minimum spanning forest
problem in simple graphs. Edge updates are supported in O(log4n/loglogn)
amortized time per operation, improving the O(log4n) amortized bound of
Holm et al. (STOC'98, JACM'01). We assume the Word-RAM model with standard
instructions.Comment: 13 pages, 2 figure