BFS-based distributed algorithm for parallel local-directed subgraph enumeration.
Itay LevinasRoy ScherzYoram LouzounPublished in: J. Complex Networks (2022)
Keyphrases
- search space
- np hard
- significant improvement
- experimental evaluation
- parallel implementation
- dynamic programming
- optimal solution
- preprocessing
- cost function
- multi agent
- objective function
- convergence rate
- parallel computation
- probabilistic model
- exhaustive search
- parallel processing
- detection algorithm
- simulated annealing
- memory efficient
- single processor
- distributed environment
- learning algorithm
- matching algorithm
- optimization algorithm
- segmentation algorithm
- expectation maximization
- distributed systems
- computational cost
- search algorithm
- bayesian networks