d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors.
Venkatesan GuruswamiSai SandeepPublished in: ICALP (2020)
Keyphrases
- color images
- color space
- graph theoretic
- graph clustering
- phase transition
- graph matching
- color quantization
- computational complexity
- np hard
- lower bound
- learning theory
- bipartite graph
- graph theory
- graph mining
- graph model
- graph partitioning
- labeled graphs
- random graphs
- color matching
- graph data
- color distribution
- neural network
- graph representation
- graph databases
- directed graph
- information theoretic
- np complete
- worst case
- bayesian networks