Complexity and algorithms for constant diameter augmentation problems - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Complexity and algorithms for constant diameter augmentation problems

Eun Jung Kim
Jérôme Monnot

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

Dates and versions

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

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More