Sparse Kneser graphs are Hamiltonian.
Torsten MützeJerri NummenpaloBartosz WalczakPublished in: CoRR (2017)
Keyphrases
- language model
- gaussian graphical models
- directed acyclic
- graph representation
- information retrieval
- series parallel
- graph model
- graph matching
- graph theory
- sparse representation
- probabilistic model
- high dimensional
- directed graph
- bipartite graph
- random projections
- compressed sensing
- data sets
- sparse coding
- graph theoretic
- sparse data
- small world
- bayesian networks