A note on the hardness of graph diameter augmentation problems

Details A note on the hardness of graph diameter augmentation problems A note on the hardness of graph diameter augmentation problems

2009-09-21

arxiv.org/abs/0909.3877v1

Computer Science

Discrete Mathematics

No figures

Scientific paper

A graph has \emph{diameter} D if every pair of vertices are connected by a path of at most D edges. The Diameter-D Augmentation problem asks how to add the a number of edges to a graph in order to make the resulting graph have diameter D. It was previously known that this problem is NP-hard \cite{GJ}, even in the D=2 case. In this note, we give a simpler reduction to arrive at this fact and show that this problem is W[2]-hard.

Affiliated with

Also associated with

No associations

Rating

A note on the hardness of graph diameter augmentation problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on the hardness of graph diameter augmentation problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on the hardness of graph diameter augmentation problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-300269