Faster Fully-Dynamic Minimum Spanning Forest
Holm, Jacob · Rotenberg, Eva · Wulff-Nilsen, Christian
Original · EN
We give a new data structure for the fully-dynamic minimum spanning forest problem in simple graphs. Edge updates are supported in O(⁴n/ n) amortized time per operation, improving the O(⁴n) amortized bound of Holm et al. (STOC'98, JACM'01). We assume the Word-RAM model with standard instructions.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.