2009/09/21 by James Nastos, Yong Gao, Nastos, James +1
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.0909.3877
openalex publication_date 2009/09/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A graph has 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 graph in order to make the resulting graph have diameter D. It was previously known that this problem is NP-hard \citeGJ, even in the D=2 case. In this note, we give a simpler reduction to arrive at this fact and show that this problem is W[2]-hard.