Complexity and algorithms for constant diameter augmentation problems - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Complexity and algorithms for constant diameter augmentation problems

Eun Jung Kim
Jérôme Monnot

Résumé

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$.

Dates et versions

hal-02958747 , version 1 (06-10-2020)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More