A Partition-centric Distributed Algorithm for Identifying Euler Circuits in Large Graphs.
Siddharth D. JaiswalYogesh SimmhanPublished in: CoRR (2019)
Keyphrases
- detection algorithm
- learning algorithm
- dynamic programming
- search space
- experimental evaluation
- times faster
- np hard
- objective function
- k means
- optimal solution
- expectation maximization
- recognition algorithm
- cost function
- preprocessing
- computational complexity
- graph isomorphism
- graph structure
- simulated annealing
- optimization algorithm
- tree structure
- matching algorithm
- graph construction
- graph model
- graph partitioning
- peer to peer
- disjoint subsets
- convergence rate
- distributed environment
- high speed
- worst case
- computational cost
- similarity measure