The Complexity of Bottleneck Labeled Graph Problems.
Refael HassinJérôme MonnotDanny SegevPublished in: WG (2007)
Keyphrases
- decision problems
- polynomial time complexity
- problems involving
- np complete
- solving problems
- computational complexity
- application domains
- graph theory
- np hardness
- search algorithm
- supervised learning
- structured data
- neural network
- connected components
- decision trees
- computational issues
- polynomial hierarchy
- genetic algorithm