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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.