On Computational Complexity of the Forcing Chromatic Number
Frank HararyWolfgang SlanyOleg VerbitskyPublished in: CoRR (2004)
Keyphrases
- computational complexity
- fixed number
- memory requirements
- computationally efficient
- small number
- maximum number
- computational effort
- multimedia
- clustering algorithm
- np complete
- special case
- low complexity
- decision problems
- computational efficiency
- multi class
- np hard
- data sets
- preprocessing
- video sequences
- wide range
- training data
- image processing
- feature selection
- genetic algorithm
- real world