Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error.
Benny ApplebaumEliran KachlonPublished in: FOCS (2019)
Keyphrases
- frequent subgraph mining
- graph mining
- graph databases
- subgraph matching
- subgraph isomorphism
- graph properties
- frequent subgraphs
- graph data
- labeled graphs
- graph structures
- error rate
- maximum common subgraph
- connected subgraphs
- maximum clique
- reachability queries
- graph clustering
- dense subgraphs
- subgraph mining
- quasi cliques
- sampling strategy
- uniform random
- graph theory
- sampling methods
- estimation error
- structured data
- sample size
- graph matching
- data structure
- hypothesis tests
- error bounds
- graph representation
- maximal cliques
- graph structure
- graph patterns
- error analysis
- graph theoretic
- biological networks