Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete.
Michal KarpinskiPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- fixed size
- np complete
- variable size
- sliding window
- np hard
- computational complexity
- randomly generated
- conjunctive queries
- satisfiability problem
- window size
- pspace complete
- data streams
- subsequence matching
- polynomial time complexity
- phase transition
- bounded treewidth
- small image patches
- database
- directed graph
- multiscale
- sample size
- image quality
- object recognition
- video sequences