Every Minor-Closed Property of Sparse Graphs is Testable.
Itai BenjaminiOded SchrammAsaf ShapiraPublished in: Electron. Colloquium Comput. Complex. (2008)
Keyphrases
- random graphs
- directed acyclic
- graph properties
- graph theoretic
- gaussian graphical models
- sparse data
- graph matching
- high dimensional
- graph structure
- queueing networks
- graph theory
- sparse representation
- undirected graph
- graph model
- graph mining
- object recognition
- directed graph
- graph kernels
- subgraph isomorphism
- sparse matrix
- series parallel
- graphical models
- strongly connected components
- bipartite graph