Sampling Based Efficient Algorithm to Estimate the Spectral Radius of Large Graphs.
Samar AbbasJuvaria TariqArif ZamanImdadullah KhanPublished in: ICDCS Workshops (2017)
Keyphrases
- learning algorithm
- cost function
- computational complexity
- computationally efficient
- high efficiency
- monte carlo
- detection algorithm
- optimization algorithm
- dynamic programming
- computational cost
- social networks
- single pass
- worst case
- pruning strategy
- k means
- optimal solution
- similarity measure
- preprocessing
- matching algorithm
- convergence rate
- estimation algorithm
- graph model
- minimum spanning tree
- spectral decomposition
- undirected graph
- particle swarm optimization
- simulated annealing
- np hard
- search algorithm