Every minor-closed property of sparse graphs is testable.
Itai BenjaminiOded SchrammAsaf ShapiraPublished in: STOC (2008)
Keyphrases
- random graphs
- graph properties
- gaussian graphical models
- graph matching
- directed acyclic
- graph model
- sparse data
- graph theoretic
- graph mining
- graph theory
- high dimensional
- directed graph
- sparse representation
- graph construction
- sparse coding
- data sets
- graph partitioning
- compressive sensing
- compressed sensing
- pairwise
- pattern recognition
- face recognition