A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling.
Sepehr AssadiMichael KapralovSanjeev KhannaPublished in: CoRR (2018)
Keyphrases
- high accuracy
- detection algorithm
- learning algorithm
- preprocessing
- experimental evaluation
- recognition algorithm
- cost function
- dynamic programming
- similarity measure
- tree structure
- significant improvement
- computational cost
- segmentation algorithm
- sampling algorithm
- matching algorithm
- optimization algorithm
- simulated annealing
- k means
- search algorithm
- data structure
- monte carlo
- convergence rate
- image processing