Sparse Kneser graphs are Hamiltonian.
Torsten MützeJerri NummenpaloBartosz WalczakPublished in: STOC (2018)
Keyphrases
- language model
- information retrieval
- compressed sensing
- high dimensional
- graph theoretic
- probabilistic model
- sparse data
- graph representation
- graph model
- sparse representation
- gaussian graphical models
- sparse coding
- directed graph
- graph theory
- complex structures
- graph partitioning
- graph matching
- pattern recognition
- subgraph isomorphism
- directed acyclic
- neural network