Funder
National Science Foundation
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. Decreasing the diameter of bounded degree graphs;Alon;J. Graph Theory,2000
2. Shortcuts for the circle;Bae;Comput. Geom. Theory Appl.,2019
3. Almost optimal algorithms for diameter-optimally augmenting trees;Bilò,2018
4. Improved approximability and non-approximability results for graph diameter decreasing problems;Bilò;Theor. Comput. Sci.,2012
5. Minimizing the continuous diameter when augmenting paths and cycles with shortcuts;De Carufel,2016
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献