(k, 1)-coloring of sparse graphs.
Oleg V. BorodinAnna O. IvanovaMickaël MontassierAndré RaspaudPublished in: Discret. Math. (2012)
Keyphrases
- gaussian graphical models
- directed acyclic
- graph matching
- high dimensional
- compressive sensing
- sparse data
- graph theoretic
- graph databases
- data sets
- graph structure
- graph theory
- sparse coding
- sparse representation
- semi supervised
- graph model
- dictionary learning
- graph representation
- random graphs
- series parallel
- densely connected
- pattern recognition