Author:
Fekete Sándor P.,Kremer Jana
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference22 articles.
1. On sparse spanners of weighted graphs;Althöfer;Discrete Comput. Geom.,1993
2. Planar spanners and approximate shortest path queries among obstacles in the plane;Arikati,1996
3. B. Awerbuch, A. Baratz, D. Peleg, Efficient broadcast and light-weight spanners, Manuscript, 1992.
4. Graph Theory with Applications;Bondy,1976
5. U. Brandes, D. Handke, NP-completeness results for minimum planar spanners, Proceedings of the 23th Workshop on Graph–Theoretic Concepts in Computer Science (WG ’97), Springer Lecture Notes in Computer Science, Vol. 1335, 1997, pp. 85–99.
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献