An efficient algorithm for stopping on a sink in a directed graph.
Wayne GoddardEwa M. KubickaGrzegorz KubickiPublished in: Oper. Res. Lett. (2013)
Keyphrases
- directed graph
- learning algorithm
- preprocessing
- maximum flow
- graph structure
- probabilistic model
- detection algorithm
- expectation maximization
- worst case
- computationally efficient
- shortest path problem
- dynamic programming
- k means
- computational complexity
- shortest path
- similarity measure
- np hard
- cost function
- particle swarm optimization
- search space
- optimal solution
- objective function
- undirected graph