An EREW PRAM fully-dynamic algorithm for MST

We provide an EREW PRAM fully-dynamic algorithm to maintain the minimum spanning tree (MST) of an undirected weighted graph under single edge insertions and deletions. Our approach combines the sparsification data structure with a novel parallel technique which efficiently treats edge deletions. The proposed parallel algorithm requires O(log n) time and O(n/sup 2/3/ log m/n) work, where n and m are respectively the number of nodes and edges of the given graph.<<ETX>>