Estimating the Number of Connected Components in a Graph via Subgraph Sampling.
Jason M. KlusowskiYihong WuPublished in: CoRR (2018)
Keyphrases
- frequent subgraph mining
- graph mining
- graph databases
- graph properties
- graph data
- graph classification
- maximum weight
- subgraph mining
- maximum matching
- frequent subgraphs
- labeled graphs
- subgraph isomorphism
- graph search
- edge weights
- bipartite graph
- subgraph matching
- structured data
- connected subgraphs
- graph theory
- connected components
- directed acyclic graph
- sampling methods
- query graph
- pattern mining
- graph partitioning
- graph model
- weighted graph
- graph structure
- directed graph
- maximum clique
- graph structures
- rigid body
- sampling algorithm
- sample size
- semi supervised
- similarity graph
- sampling strategy
- graph clustering
- normalized cut