Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference39 articles.
1. New and improved spanning ratios for Yao graphs;Barba;J. Comput. Geom.,2015
2. Computational Geometry: Algorithms and Applications;Berg,2008
3. N. Bonichon, C. Gavoille, N. Hanusse, D. Ilcinkas, Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces, in: The 36th International Workshop on Graph-Theoretic Concepts in Computer Science, 2010, pp. 266–278.
4. Towards tight bounds on theta-graphs;Bose;Theoret. Comput. Sci.,2015
5. P. Bose, R. Fagerberg, A.v. Renssen, S. Verdonschot, Competitive routing in the half-θ6-graph, in: ACM-SIAM Symposium on Discrete Algorithms, 2012, pp. 1319–1328.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献