Complexity and algorithms for constant diameter augmentation problems

•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.•For d=3, the problem is related to Moore graphs and solvable in polynomial time.•For all d>4,...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 904; s. 15 - 26
Hlavní autori:	Kim, Eun Jung, Milanič, Martin, Monnot, Jérôme, Picouleau, Christophe
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.02.2022
Predmet:	Blocker problem Graph diameter NP-complete Polynomial algorithm Graph diameter Blocker problem NP-complete Polynomial algorithm
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!