The Induced Removal Lemma in Sparse Graphs.
Shachar SapirAsaf ShapiraPublished in: Comb. Probab. Comput. (2020)
Keyphrases
- sparse data
- gaussian graphical models
- graph matching
- directed graph
- graph mining
- dictionary learning
- sparse representation
- high dimensional
- johnson lindenstrauss
- random graphs
- graph theoretic
- spanning tree
- graph theory
- graphical models
- undirected graph
- complex structures
- graph structure
- compressive sensing
- compressed sensing
- subgraph isomorphism
- series parallel
- directed acyclic
- np hard
- database