7 citations · 12 across the 5 of their papers we have counts for
1 paper · 1 filter
James Nastos, Yong Gao
A graph has \emph{diameter} D if every pair of vertices are connected by a path of at most D edges. The Diameter-D Augmentation problem asks how to add the a number of edges to a g…