)-Space Algorithm for the Grid Graph Reachability Problem.
Ryo AshidaKotaro NakagawaPublished in: CoRR (2018)
Keyphrases
- dynamic programming
- learning algorithm
- detection algorithm
- graph based algorithm
- search space
- cost function
- undirected graph
- objective function
- computational cost
- matching algorithm
- tree structure
- computational complexity
- graph construction
- directed graph
- optimization algorithm
- expectation maximization
- k means
- preprocessing
- genetic algorithm
- np hard
- distance transform
- graph structure
- space requirements
- depth first search
- maximum flow
- optimal solution
- solution path
- polynomial time complexity