BFS based distributed algorithm for parallel local directed sub-graph enumeration.
Itay LevinasRoy ScherzYoram LouzounPublished in: CoRR (2022)
Keyphrases
- dynamic programming
- breadth first search
- depth first search
- parallel implementation
- detection algorithm
- learning algorithm
- k means
- probabilistic model
- worst case
- graph structure
- optimal solution
- parallel version
- graph based algorithm
- graph model
- clustering method
- cost function
- search space
- computational complexity
- segmentation algorithm
- random walk
- expectation maximization
- particle swarm optimization
- exhaustive search
- simulated annealing
- knn
- spanning tree
- minimum spanning tree
- graph clustering
- preprocessing