Complexity of list coloring problems with a fixed total number of colors.
Sylvain GravierDaniel KoblerWieslaw KubiakPublished in: Discret. Appl. Math. (2002)
Keyphrases
- fixed number
- small number
- decision problems
- polynomial time complexity
- computational complexity
- problems involving
- np complete
- artificial intelligence
- memory requirements
- maximum number
- space complexity
- finite number
- np hard
- video sequences
- clustering algorithm
- computationally challenging
- polynomial hierarchy
- knowledge base