O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem.
Tetsuo AsanoDavid G. KirkpatrickKotaro NakagawaOsamu WatanabePublished in: Electron. Colloquium Comput. Complex. (2014)
Keyphrases
- worst case
- directed graph
- objective function
- computational complexity
- detection algorithm
- learning algorithm
- shortest path problem
- search space
- graph structure
- segmentation algorithm
- dynamic programming
- k means
- simulated annealing
- state space
- tree structure
- optimal solution
- space requirements
- maximum flow
- expectation maximization
- combinatorial optimization
- random walk
- social networks