Author:
Ahmed Reyan,Hamm Keaton,Kobourov Stephen,Jebelli Mohammad Javad Latifi,Sahneh Faryad Darabi,Spence Richard
Publisher
Springer Nature Switzerland
Reference31 articles.
1. Abboud, A., Bodwin, G.: Lower bound amplification theorems for graph spanners. In: Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841–856 (2016)
2. Abboud, A., Bodwin, G.: The 4/3 additive spanner exponent is tight. J. ACM (JACM) 64(4), 28 (2017)
3. Ahmed, A.R., et al.: Multi-level Steiner trees. In: 17th International Symposium on Experimental Algorithms (SEA), pp. 15:1–15:14 (2018). https://doi.org/10.4230/LIPIcs.SEA.2018.15
4. Lecture Notes in Computer Science;R Ahmed,2021
5. Ahmed, R., et al.: Graph spanners: a tutorial review. Comput. Sci. Rev. 37, 100253 (2020)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Multi-priority Graph Sparsification;Lecture Notes in Computer Science;2023