Complexity and algorithms for constant diameter augmentation problems - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2022

Complexity and algorithms for constant diameter augmentation problems

Martin Milanic
  • Function : Author
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-03107522 , version 1 (12-01-2021)

Identifiers

Cite

Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau. Complexity and algorithms for constant diameter augmentation problems. Theoretical Computer Science, 2022, 904, pp.15-26. ⟨10.1016/j.tcs.2021.05.020⟩. ⟨hal-03107522⟩
106 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More