Maintaining minimum spanning trees in dynamic graphs
| Author(s) : | Monika Rauch Henzinger Valerie King, |
| Publisher : | N/A |
| Publication Date : | 1997 |
| ISSN : | N/A |
| Abstract : | We present the first fully dynamic algorithm for maintaining a minimum spanning tree in time o ( # n) per operation. To be precise, the algorithm uses O(n, |