Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error.
Benny ApplebaumEliran KachlonPublished in: SIAM J. Comput. (2023)
Keyphrases
- frequent subgraph mining
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- subgraph matching
- graph structures
- labeled graphs
- reachability queries
- frequent subgraphs
- maximum common subgraph
- graph data
- connected subgraphs
- dense subgraphs
- error rate
- graph structure
- pattern mining
- data structure
- topological information
- random sampling
- subgraph mining
- graph clustering
- maximum clique
- query graph
- graph patterns
- sampling strategy
- graph search
- graph theoretic
- estimation error
- graph theory
- bipartite graph
- error bounds
- sample size
- maximal cliques
- sampled data
- graph model
- data objects
- directed graph
- monte carlo
- uniform random
- association rules