Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. A near-optimal algorithm for finding an optimal shortcut of a tree;Oh,2016
2. Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees;Wang;Theor. Comput. Sci.,2021
3. An improved algorithm for diameter-optimally augmenting paths in a metric space;Wang;Comput. Geom.,2018
4. Fast algorithms for diameter-optimally augmenting paths and trees;Große;Int. J. Found. Comput. Sci.,2019
5. Minimizing the continuous diameter when augmenting paths and cycles with shortcuts;Carufel,2016
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献