On estimating the Spectral Radius of large graphs through subgraph sampling.
Xiaoyu ChuHarish SethuPublished in: INFOCOM Workshops (2015)
Keyphrases
- frequent subgraph mining
- graph mining
- graph databases
- subgraph matching
- graph classification
- subgraph isomorphism
- graph properties
- graph data
- spectral decomposition
- labeled graphs
- graph matching
- frequent subgraphs
- random sampling
- connected subgraphs
- maximum clique
- subgraph mining
- dense subgraphs
- graph clustering
- rigid body
- weighted graph
- graph partitioning
- graph theory
- spectral methods
- query graph
- np hard
- sampling strategy
- graph structures
- sampling algorithm
- graph theoretic
- graph structure
- pattern mining
- monte carlo
- maximal cliques
- sampling methods
- edge weights
- similarity graph
- graph model
- bipartite graph
- sample size
- search space