O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem.
Ryo AshidaKotaro NakagawaPublished in: SoCG (2018)
Keyphrases
- preprocessing
- graph structure
- optimization algorithm
- computational cost
- computational complexity
- graph based algorithm
- probabilistic model
- search space
- optimal solution
- k means
- higher dimensional
- graph model
- shortest path problem
- simulated annealing
- learning algorithm
- graph construction
- expectation maximization
- detection algorithm
- worst case
- cost function
- objective function
- binary images
- tree structure
- graph theory
- dynamic programming
- spanning tree
- search algorithm
- minimum spanning tree
- space requirements
- depth first search
- similarity measure