Homomorphisms from sparse graphs with large girth.
Oleg V. BorodinSeog-Jin KimAlexandr V. KostochkaDouglas B. WestPublished in: J. Comb. Theory, Ser. B (2004)
Keyphrases
- graph theory
- gaussian graphical models
- graph theoretic
- sparse data
- high dimensional
- sparse representation
- graph matching
- graph kernels
- sparse matrix
- data sets
- graph databases
- graph model
- directed acyclic
- weighted graph
- sparse coding
- finite state automata
- adjacency matrix
- graph partitioning
- compressed sensing
- random graphs
- graph representation
- graph mining
- neural network