The Complexity of Bottleneck Labeled Graph Problems.

Refael Hassin Jérôme Monnot Danny Segev

Published in: Algorithmica (2010)

Keyphrases

decision problems
optimization problems
computational cost
np complete
random walk
solving problems
maximum independent set
training data
computational complexity
feature space
application domains
problems involving
np hardness
steiner tree