Poisson approximation of counts of induced subgraphs in random intersection graphs.
Katarzyna RybarczykDudley StarkPublished in: Discret. Math. (2017)
Keyphrases
- graph mining
- closed form
- graph databases
- labeled graphs
- subgraph matching
- graph structures
- subgraph isomorphism
- connected subgraphs
- graph properties
- reachability queries
- subgraph mining
- maximum common subgraph
- graph data
- topological information
- data structure
- graph theory
- approximation error
- graph patterns
- maximum clique
- structured data
- dense subgraphs
- maximal cliques
- query graph
- graph representation
- negative binomial
- central limit theorem
- pattern mining
- approximation algorithms
- graph structure
- graph theoretic
- spanning tree
- edit distance
- graph matching
- directed graph
- frequent subgraphs
- poisson process
- quasi cliques
- contingency tables