David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert E. Tarjan, Jeffery Westbrook, Moti Yung  Home/Search
Context Related
| yale.edu/WWW/users...ic_planar_mst.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uci.edu/~eppstein/pub...graphdyn (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Similar documents based on text: More All
0.5: Fully Dynamic Planarity Testing with Applications - Galil, Italiano, Sarnak (Correct)
0.3: Fully Dynamic Algorithms for Edge Connectivity Problems - Galil, Italiano (1991) (Correct)
0.2: Fast Incremental Planarity Testing - Westbrook (1992) (Correct)
BibTeX entry: (Update)
D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung, Maintenance of a minimum spanning forest in a dynamic planar graph, J. Algorithms, 13 (1992), pp. 33--54. http://citeseer.ist.psu.edu/eppstein92maintenance.html More
@inproceedings{ eppstein90maintenance,
author = "David Eppstein and Giuseppe F. Italiano and Roberto Tamassia and Robert Endre Tarjan and Jeffery Westbrook and Moti Yung",
title = "Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph",
booktitle = "Symposium on Discrete Algorithms",
pages = "1-11",
year = "1990",
url = "citeseer.ist.psu.edu/eppstein92maintenance.html" }
Citations (may not include all citations):474 Graph Theory (context) - Harary - 1972
257 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
192 Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
183 A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
164 Society for Industrial and Applied Mathematics (context) - Tarjan, Network - 1983
135 and graph planarity using PQ-tree algorithms (context) - Booth, Lueker et al. - 1976
118 Data structures for on-line updating of minimum spanning tre.. (context) - Frederickson - 1985
117 Efficient planarity testing (context) - Hopcroft, Tarjan - 1974
80 Amortized computational complexity (context) - Tarjan - 1985
75 A linear algorithm for embedding planar graphs using PQ-tree.. (context) - Chiba, Nishizeki et al. - 1985
50 Incremental algorithms for minimal length paths (context) - Ausiello, Italiano et al. - 1990
50 line edge deletion problem (context) - Even, Shiloach - 1981
37 Finding minimum spanning trees (context) - Cheriton, Tarjan - 1976
36 Graph Theory (context) - Tutte - 1984
33 Updating distances in dynamic graphs (context) - Even, Gazit - 1985
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/graph-dyn.html):
Dynamic Connectivity in Digital Images - Eppstein (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC