An Optimal Algorithm for the Period of a Strongly Connected Digraph.
Adriano PascolettiPublished in: Inf. Process. Lett. (1992)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- cost function
- learning algorithm
- globally optimal
- computational cost
- search space
- strongly connected
- preprocessing
- k means
- objective function
- recognition algorithm
- optimization algorithm
- detection algorithm
- similarity measure
- significant improvement
- training set
- probabilistic model
- expectation maximization
- tree structure
- matching algorithm
- exhaustive search
- reinforcement learning