We study the following problem: for given integers d,k and graph G, can we obtain a graph with diameter d via at most k edge deletions ? We determine the computational complexity of this and related problems for different values of d.
@article{arxiv.2010.00273,
title = {Complexity and algorithms for constant diameter augmentation problems},
author = {Eun Jung Kim and Martin Milanic and Jérôme Monnot and Christophe Picouleau},
journal= {arXiv preprint arXiv:2010.00273},
year = {2020}
}