Acyclic 3-choosability of sparse graphs with girth at least 7.
Oleg V. BorodinMin ChenAnna O. IvanovaAndré RaspaudPublished in: Discret. Math. (2010)
Keyphrases
- gaussian graphical models
- high dimensional
- np hard
- graph matching
- graph theory
- sparse data
- sparse representation
- graph mining
- graph theoretic
- database schemes
- sparse coding
- graph representation
- random projections
- directed acyclic
- markov equivalence classes
- connected graphs
- series parallel
- graph kernels
- graph model
- directed graph
- special case