Author:
Bilò Davide,Gualà Luciano,Proietti Guido
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. Decreasing the diameter of bounded degree graphs;Alon;Journal of Graph Theory,2000
2. A Textbook of Graph Theory;Balakrishnan,2000
3. Graph classes: a survey;Brandstädt;SIAM Monographs on Discrete Mathematics and Applications,1999
4. Location on tree networks: p-centre and n-dispersion problems;Chandrasekaran;Mathematics of Operations Research,1981
5. Mixed covering of trees and the augmentation problem with odd diameter constraints;Chepoi;Algorithmica,2006
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimizing Reconfigurable Optical Datacenters: The Power of Randomization;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2023-11-11
2. Algorithms for radius-optimally augmenting trees in a metric space;Computational Geometry;2023-10
3. Augmenting graphs to minimize the radius;Computational Geometry;2023-08
4. Online and Approximate Network Construction from Bounded Connectivity Constraints;International Journal of Foundations of Computer Science;2023-01-06
5. Finding Diameter-Reducing Shortcuts in Trees;Lecture Notes in Computer Science;2023