Neighbor sum distinguishing edge colorings of sparse graphs.
Xiaolan HuYaojun ChenRong LuoZhengke MiaoPublished in: Discret. Appl. Math. (2015)
Keyphrases
- weighted graph
- undirected graph
- densely connected
- nearest neighbor
- edge detection
- gaussian graphical models
- minimum spanning trees
- high dimensional
- graph matching
- directed acyclic
- graph structure
- graph theoretic
- edge weights
- weighted sum
- edge information
- sparse representation
- sparse data
- graph partitioning
- graph mining
- edge map
- objective function
- subgraph isomorphism
- graph clustering
- spanning tree
- sparse coding
- edge detector
- adjacency graph
- graph databases
- neighbor selection
- graph coloring
- complex structures
- graph theory
- approximation algorithms
- image classification
- graphical models
- search algorithm