A Self-Stabilizing Algorithm for Constructing ST-Reachable Directed Acyclic Graph When lS| ≤ 2 and |T| ≤ 2.
Yonghwan KimMasahiro ShibataYuichi SudoJunya NakamuraYoshiaki KatayamaToshimitsu MasuzawaPublished in: ICDCS (2019)
Keyphrases
- dynamic programming
- directed acyclic graph
- learning algorithm
- np hard
- detection algorithm
- k means
- objective function
- search space
- cost function
- computational cost
- particle swarm optimization
- shortest path problem
- undirected graph
- pattern mining
- segmentation algorithm
- expectation maximization
- worst case
- probabilistic model
- preprocessing
- computational complexity