Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders.
Benny ApplebaumEliran KachlonPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- frequent subgraph mining
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- labeled graphs
- graph properties
- subgraph mining
- reachability queries
- maximum common subgraph
- graph data
- frequent subgraphs
- graph structures
- connected subgraphs
- query graph
- graph patterns
- graph theoretic
- graph clustering
- topological information
- maximum clique
- dense subgraphs
- sampling algorithm
- monte carlo
- pattern mining
- uniform random
- data structure
- directed graph
- graph representation
- bipartite graph
- connected components
- graph matching
- graph model
- random sampling
- sampling methods
- graph search
- graph structure
- sample size
- structured data
- association rules