Adjacent vertex distinguishing colorings by sum of sparse graphs.
Xiaowei YuCunquan QuGuanghui WangYiqiao WangPublished in: Discret. Math. (2016)
Keyphrases
- attributed graphs
- undirected graph
- directed graph
- labeled graphs
- hamiltonian cycle
- graph coloring
- gaussian graphical models
- high dimensional
- graph matching
- graph mining
- directed acyclic
- connected subgraphs
- weighted sum
- sparse data
- genetic algorithm
- sparse matrix
- graph databases
- maximum cardinality
- average degree
- sparse representation
- vertex set
- subgraph isomorphism
- sparse coding
- approximation algorithms
- phase transition
- evolutionary algorithm
- dimensionality reduction
- np complete
- graph theory
- constraint programming
- graph kernels
- random graphs
- compressive sensing
- graph data
- graph theoretic
- graph representation
- combinatorial problems