# Complexity and algorithms for constant diameter augmentation problems

3 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
Abstract : 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$.
Document type :
Preprints, Working Papers, ...
Domain :
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02958747
Contributor : Christophe Picouleau Connect in order to contact the contributor
Submitted on : Tuesday, October 6, 2020 - 11:05:53 AM
Last modification on : Friday, August 5, 2022 - 2:54:01 PM

### Identifiers

• HAL Id : hal-02958747, version 1
• ARXIV : 2010.00273

### Citation

Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau. Complexity and algorithms for constant diameter augmentation problems. 2020. ⟨hal-02958747⟩

Record views