Coloring the square of a sparse graph G with almost Δ(G) colors.
Matthew P. YanceyPublished in: Discret. Appl. Math. (2016)
Keyphrases
- gaussian graphical models
- weighted graph
- random walk
- graph representation
- color information
- color images
- structured data
- color space
- directed graph
- graph matching
- graph construction
- high dimensional
- link analysis
- graph model
- graph clustering
- sparse data
- graph theory
- graph theoretic
- spanning tree
- neural network
- bipartite graph
- pairwise