MAINTENANCE OF A MINIMUM SPANNING FOREST IN A DYNAMIC PLANE GRAPH

被引:66
作者
EPPSTEIN, D
ITALIANO, GF
TAMASSIA, R
TARJAN, RE
WESTBROOK, J
YUNG, M
机构
[1] UNIV CALIF IRVINE, DEPT INFORMAT & COMP SCI, IRVINE, CA 92715 USA
[2] IBM CORP, DIV RES, TJ WATSON RES CTR, YORKTOWN HTS, NY 10598 USA
[3] BROWN UNIV, DEPT COMP SCI, PROVIDENCE, RI 02912 USA
[4] PRINCETON UNIV, DEPT COMP SCI, PRINCETON, NJ 08544 USA
[5] NEC RES INST, PRINCETON, NJ 08540 USA
[6] YALE UNIV, DEPT COMP SCI, NEW HAVEN, CT 06520 USA
[7] COLUMBIA UNIV, DEPT COMP SCI, NEW YORK, NY 10027 USA
来源
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 1992年 / 13卷 / 01期
基金
美国国家科学基金会;
关键词
D O I
10.1016/0196-6774(92)90004-V
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. To implement the algorithms, we develop a data structure called an edge-ordered dynamic tree, which is a variant of the dynamic tree data structure of Sleator and Tarjan. Using this data structure, our algorithm runs in O(log n) time per operation and O(n) space. The algorithm can be used to maintain the connected components of a dynamic planar graph in O(logn) time per operation. We also show that any algorithm will need Ω(log n) amortized time per operation, given a set of machine operations that is fairly general. © 1992.
引用
收藏
页码:33 / 54
页数:22
相关论文
共 35 条
[1]  
AUSIELLO G, 1990, PROCEEDINGS OF THE FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P12
[2]  
BATTISTA GD, 1989, 30TH P IEEE S F COMP, P436
[3]  
BATTISTA GD, 1989, CS8931 BROWN U DEP C
[4]   TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS [J].
BOOTH, KS ;
LUEKER, GS .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) :335-379
[5]  
Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051
[6]   A LINEAR ALGORITHM FOR EMBEDDING PLANAR GRAPHS USING PQ-TREES [J].
CHIBA, N ;
NISHIZEKI, T ;
ABE, S ;
OZAWA, T .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (01) :54-76
[7]   ALGORITHMS FOR UPDATING MINIMAL SPANNING TREES [J].
CHIN, F ;
HOUCK, D .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 16 (03) :333-344
[8]  
EVEN S, 1981, J ACM, V28, P1, DOI 10.1145/322234.322235
[9]   DATA-STRUCTURES FOR ONLINE UPDATING OF MINIMUM SPANNING-TREES, WITH APPLICATIONS [J].
FREDERICKSON, GN .
SIAM JOURNAL ON COMPUTING, 1985, 14 (04) :781-798
[10]  
GABOW HN, 1985, LECT NOTES COMPUT SC, V194, P210