Author:
Amarnadh Narayanasetty,Mitra Pinaki
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Chew, L.P.: There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences 39, 205–219 (1989)
2. Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete and Computational Geometry 5, 399–407 (1990)
3. Mulzer, W.: Minimum dilation triangulations for the regular n-gon. Diploma Thesis. Freie universitat Berlin (2004)
4. Eppstein, D.: Spanning trees and Spanners. In: Sack, J.R., Urrutia, J. (eds.) Handbook of computational Geometry, pp. 425–465. Elsevier, Amsterdam (1999)
5. Lecture Notes in Computer Science;J.M. Keil,1989
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lower Bounds on the Dilation of Plane Spanners;Algorithms and Discrete Applied Mathematics;2016