A Partition-Centric Distributed Algorithm for Identifying Euler Circuits in Large Graphs.
Siddharth D. JaiswalYogesh SimmhanPublished in: IPDPS Workshops (2019)
Keyphrases
- experimental evaluation
- learning algorithm
- computational complexity
- optimization algorithm
- dynamic programming
- high accuracy
- preprocessing
- detection algorithm
- segmentation algorithm
- np hard
- particle swarm optimization
- similarity measure
- matching algorithm
- worst case
- cost function
- k means
- search space
- optimal solution
- convergence rate
- graph partitioning
- graph clustering
- graph construction
- partitioning algorithm