Edge Sample and Discard: A New Algorithm for Counting Triangles in Large Dynamic Graphs.
Guyue HanHarish SethuPublished in: ASONAM (2017)
Keyphrases
- computational complexity
- worst case
- detection algorithm
- undirected graph
- particle swarm optimization
- dynamic programming
- computational cost
- graph structure
- matching algorithm
- np hard
- delaunay triangulation
- k means
- optimal solution
- segmentation algorithm
- learning algorithm
- clustering method
- objective function
- graph isomorphism
- graph clustering
- weighted graph
- dynamic environments
- expectation maximization
- cost function
- search space