Maintaining biconnected components of dynamic planar graphs-Reference-Cited by-同舟云学术

Maintaining biconnected components of dynamic planar graphs

Published:1991 Issue: Volume: Page:339-350
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Galil Zvi,Italiano Giuseppe F.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54233-7_146.pdf

Reference22 articles.

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.

2. G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, U. Nanni, “Incremental algorithms for minimal length paths”, J. Algorithms, to appear.

3. G. Di Battista, and R. Tamassia, “Incremental planarity testing”, Proc. 30th Annual Symp. on Foundations of Computer Science, 1989, 436–441.

4. G. Di Battista, and R. Tamassia, “On-line graph algorithms with SPQR-trees”, Proc. 17th Int. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 443, Springer-Verlag, Berlin, 1990, 598–611.

5. 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”, Proc. First Annual ACM-SIAM Symp. on Discrete Algorithms, 1990, 1–11.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maintaining Center and Median in Dynamic Trees;Algorithm Theory - SWAT 2000;2000

2. Faster Shortest-Path Algorithms for Planar Graphs;Journal of Computer and System Sciences;1997-08

3. On-Line Planarity Testing;SIAM Journal on Computing;1996-10

4. A fully dynamic data structure for reachability in planar digraphs;Algorithms—ESA '93;1993

5. Fully dynamic planarity testing in planar embedded graphs;Algorithms—ESA '93;1993