Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph (1992)
by
David Eppstein
,
Giuseppe F. Italiano
,
Roberto Tamassia
,
Robert E. Tarjan
,
Jeffery Westbrook
,
Moti Yung
| Citations: | 62 - 26 self |
BibTeX
@MISC{Eppstein92maintenanceof,
author = {David Eppstein and Giuseppe F. Italiano and Roberto Tamassia and Robert E. Tarjan and Jeffery Westbrook and Moti Yung},
title = {Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph},
year = {1992}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We give an efficient algorithm for maintaining a minimum spanning forest of a plane graph subject to on-line modifications. The modifications supported include changes in the edge weights, and insertion and deletion of edges and vertices which are consistent with the given embedding. Our algorithm runs in O(log n) time per operation and O(n) space.
