$d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors.
Venkatesan GuruswamiSai SandeepPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- color images
- graph matching
- graph theoretic
- np complete
- color space
- np hard
- phase transition
- color matching
- subgraph isomorphism
- graph clustering
- directed graph
- worst case
- learning theory
- color information
- bipartite graph
- graph structure
- color histogram
- graph mining
- spanning tree
- small number
- pattern recognition
- search algorithm
- neural network