Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Complexity and algorithms for constant diameter augmentation problems

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$.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02958747
Contributor : Christophe Picouleau <>
Submitted on : Tuesday, October 6, 2020 - 11:05:53 AM
Last modification on : Tuesday, January 12, 2021 - 5:10:03 PM

Links full text

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⟩

Share

Metrics

Record views

28