On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.
Fernanda CoutoLuérbio FariaSylvain GravierSulamita KleinVinícius Fernandes dos SantosPublished in: WG (2015)
Keyphrases
- optimization problems
- benchmark problems
- decision problems
- neural network
- computational issues
- problems involving
- evolutionary algorithm
- computational complexity
- lower bound
- upper bound
- worst case
- np complete
- application domains
- pattern recognition
- knowledge base
- bipartite graph
- information systems
- solving problems
- database