Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference20 articles.
1. T. Asano, B. Bhattacharya, M. Keil, and F. F. Yao. Clustering algorithms based on minimum and maximum spanning trees.Proceedings of the 4th Annual Symposium on Computational Geometry, 1988, pp. 252–257.
2. M. J. Atallah. Some dynamic computational geometry problems.Journal of Computational and Applied Mathematics, Vol. 11, 1985, pp. 1117–1181.
3. B. Chazelle, R. Cole, F. P. Preparata, and C. Yap. New upper bounds for neighbor searching.Information and Control, Vol. 68, 1986, pp. 105–124.
4. L. P. Chew and R. L. Drysdale. Voronoi diagrams based on convex distance functions.Proceedings of the 1st ACM Symposium on Computational Geometry, 1985, pp. 235–244.
5. W. Cunningham. Optimal attack and reinforcement of a network.Journal of the Association for Computing Machinery, Vol. 32, No. 3, 1985, pp. 549–561.
Cited by
89 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献