An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability.
Tatsuya ImaiKotaro NakagawaAduri PavanN. V. VinodchandranOsamu WatanabePublished in: Computational Complexity Conference (2013)
Keyphrases
- dynamic programming
- learning algorithm
- computational complexity
- cost function
- times faster
- optimization algorithm
- worst case
- optimal solution
- search space
- preprocessing
- significant improvement
- np hard
- experimental evaluation
- recognition algorithm
- higher dimensional
- expectation maximization
- theoretical analysis
- neural network
- convergence rate
- clustering method
- tree structure
- matching algorithm
- strongly polynomial
- solution space
- detection algorithm
- simulated annealing
- high accuracy
- k means
- similarity measure