Sparse graphs of girth at least five are packable.
Agnieszka GörlichAndrzej ZakPublished in: Discret. Math. (2012)
Keyphrases
- gaussian graphical models
- graph theory
- graph matching
- high dimensional
- graph representation
- graph databases
- directed graph
- series parallel
- compressive sensing
- sparse data
- neural network
- graph theoretic
- sparse coding
- image classification
- graph model
- dictionary learning
- graph kernels
- graph mining
- complex structures
- database
- graph structure
- bipartite graph
- sparse representation
- real time