Randomized dynamic graph algorithms with polylogarithmic time per operation
Maintenance of a minimum spanning forest in a dynamic planar graph