Colouring graphs with sparse neighbourhoods: Bounds and applications.
Marthe BonamyThomas PerrettLuke PostlePublished in: J. Comb. Theory, Ser. B (2022)
Keyphrases
- face recognition
- sparse representation
- upper bound
- lower bound
- directed acyclic
- sparse data
- principal component analysis
- gaussian graphical models
- lower and upper bounds
- graph matching
- error bounds
- graph theoretic
- theoretical guarantees
- high dimensional
- undirected graph
- dictionary learning
- worst case
- sparse matrix
- graph model
- graph databases
- graph construction
- series parallel
- multi class