Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. B. Chandra, G. Das, G. Narasimhan and J. Soares. New sparseness results on graph spanners. Proc. 8th ACM Sympos. Comput. Geom., 1992, pp. 192–201.
2. G. Das and P.J. Heffernan. Constructing degree-3 spanners with other sparseness properties. Proc. 4th Annual Intern. Symp. on Algorithms, Lecture Notes in Computer Science, Vol. 762, Springer-Verlag, Berlin, 1993, pp. 11–20.
3. G. Das, P. Heffernan and G. Narasimhan. Optimally sparse spanners in 3-dimensional Euclidean space. Proc. 9th Annu. ACM Sympos. Comput. Geom., 1993, pp. 53–62.
4. G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. Proc. 10th Annu. ACM Sympos. Comput. Geom., 1994.
5. G. Das, G. Narasimhan and J. Salowe. Properties of Steiner minimum trees with applications to small weight Euclidean graphs. Manuscript, 1994.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献