An exact upper bound on the size of minimal clique covers.
Ryan McIntyreMichael SoltysPublished in: CoRR (2017)
Keyphrases
- upper bound
- lower bound
- branch and bound algorithm
- worst case
- maximum clique
- upper and lower bounds
- real world
- computational complexity
- constant factor
- lower and upper bounds
- branch and bound
- neural network
- generalization error
- data sets
- image segmentation
- databases
- maximum number
- approximation algorithms
- standard deviation
- search engine
- np hard
- information systems
- optimal solution