A note on the hardness of graph diameter augmentation problems

James Nastos Yong Gao

Published in: CoRR (2009)

Keyphrases

computational complexity
decision trees
lower bound
special case
np complete
structured data
data mining
image segmentation
worst case
graph model
graph theoretic