Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Cole R, Goodrich MT. Optimal parallel algorithms for polygon and pointset problems. Department of computer science, 88–14, Johns Hopkins University, 1988.
2. Chiang Y, Tamassia R. Dynamic algorithms in computational geometry. Tech Report CS-91-24, Department of Computer Science, Brown University, 1991.
3. Frederickson G.. Planar graph decomposition and all pairs shortest paths. JACM 38:162–204, January 1991
4. Frieze A, Miller GM, Teng S-H. Separator based Parallel divide and conquer in computational geometry. Proceedings, Symposium on Parallel Algorithms and Architectures, 1992.
5. Gazit H, Miller GL A parallel algorithm for finding a separator in planar graphs. Proceedings, Twenty-Eighth Annual Symposium on Foundations of Computer Science 238–248, 1987.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献