Author:
Italiano Giuseppe F.,La Poutré Johannes A.,Rauch Monika H.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. A. V. Aho, J. E. Hopcroft, J. D. Ullman, “The Design and Analysis of Computer Algorithms” Addison-Wesley, Reading, Massachusetts, 1974.
2. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, M. Yung, “Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph” J. Algorithms, 13 (1992), 33–54.
3. D. Eppstein, Z. Galil, G. F. Italiano, A. Nissenzweig, “Sparsification — A Technique for Speeding Up Dynamic Graph Algorithms” Proc. 33rd FOCS, 1992, 60–69.
4. D. Eppstein, Z. Galil, G. F. Italiano, T. H. Spencer, “Separator Based Sparsification for Dynamic Planar Graph Algorithms” Proc. 25th STOC, 1993, 208–217.
5. S. Even, R. E. Tarjan, “Computing an st-numbering” Theoretical Computer Science, 2 (1976), 339–344.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The State of the Art in Dynamic Graph Algorithms;SOFSEM 2018: Theory and Practice of Computer Science;2017-12-22
2. Dynamic Planar Embeddings of Dynamic Graphs;Theory of Computing Systems;2017-04-20
3. Fully Dynamic Planarity Testing;Encyclopedia of Algorithms;2016
4. Fast Dynamic Graph Algorithms for Parameterized Problems;Algorithm Theory – SWAT 2014;2014
5. Fully Dynamic Planarity Testing;Encyclopedia of Algorithms;2008