Edge Sample and Discard: A New Algorithm for Counting Triangles in Large Dynamic Graphs.
Guyue HanHarish SethuPublished in: CoRR (2017)
Keyphrases
- learning algorithm
- dynamic programming
- preprocessing
- computational complexity
- detection algorithm
- cost function
- probabilistic model
- particle swarm optimization
- graph partitioning
- graph model
- matching algorithm
- worst case
- computational cost
- k means
- objective function
- neural network
- segmentation algorithm
- sample size
- graph structure
- optimal solution
- edge weights
- minimum spanning tree
- delaunay triangulation
- edge detection algorithm
- graph isomorphism