On the Holroyd-Talbot conjecture for sparse graphs.
Peter FranklGlenn HurlbertPublished in: Discret. Math. (2024)
Keyphrases
- high dimensional
- gaussian graphical models
- directed acyclic
- sparse data
- directed graph
- graph theory
- neural network
- graph mining
- sparse representation
- data mining
- graph matching
- multiscale
- graph theoretic
- weighted graph
- dictionary learning
- real time
- principal component analysis
- series parallel
- graph partitioning
- data structure
- graph structure
- support vector
- bipartite graph
- sparse coding
- feature space
- pairwise