Minimum chromaticity of circulant graphs.
Nenad ObradoviçJoseph G. PetersGoran RuzicPublished in: Discret. Math. (2005)
Keyphrases
- spanning tree
- connected dominating set
- least squares
- graph matching
- graph theory
- minimum cost
- color images
- fourier transform
- series parallel
- graph theoretic
- complex structures
- graph structure
- optimal solution
- graph mining
- image processing
- bipartite graph
- directed graph
- graph representation
- social network analysis
- graph clustering
- lower bound
- condition number
- square error