The parametric complexity of graph diameter augmentation

• Published in: Discrete Applied Mathematics Vol. 161; no. 10-11; pp. 1626 - 1631
• Main Authors: Gao, Yong, Hare, Donovan R., Nastos, James
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.07.2013
• Subjects: [formula omitted]-hard; Augmentation; Complexity; Fixed-parameter tractability; Graph augmentation; Graph diameter; Graphs; Integers; Lithium; Mathematical analysis; Reduction; Graph diameter; W-hard; Reduction; Fixed-parameter tractability; Graph augmentation

The diameter of a graph is the maximum distance between any pair of vertices in the graph. The Diameter-tAugmentation problem takes as input a graph G=(V,E) and a positive integer k and asks whether there exists a set E2 of at most k new edges so that the graph G2=(V,E∪E2) has diameter t. This probl...