A Sample-Based Algorithm for Approximately Testing r-Robustness of a Digraph.
Yuhao YiYuan WangXingkang HeStacy PattersonKarl Henrik JohanssonPublished in: CoRR (2022)
Keyphrases
- computational complexity
- detection algorithm
- search space
- computationally efficient
- computational cost
- computational efficiency
- optimization algorithm
- dynamic programming
- recognition algorithm
- segmentation algorithm
- expectation maximization
- high accuracy
- probabilistic model
- improved algorithm
- times faster
- tree structure
- experimental evaluation
- np hard
- optimal solution
- objective function
- similarity measure
- learning algorithm
- neural network
- maximum likelihood
- cost function
- multi objective
- preprocessing
- clustering method
- matching algorithm
- bayesian networks
- convergence rate