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

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 904; pp. 15 - 26
Main Authors:	Kim, Eun Jung, Milanič, Martin, Monnot, Jérôme, Picouleau, Christophe
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.02.2022
Subjects:	Blocker problem Graph diameter NP-complete Polynomial algorithm Graph diameter Blocker problem NP-complete Polynomial algorithm
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!