An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability.
Rahul JainRaghunath TewariPublished in: FSTTCS (2019)
Keyphrases
- learning algorithm
- segmentation algorithm
- shortest path problem
- optimization algorithm
- search space
- graph based algorithm
- preprocessing
- detection algorithm
- tree structure
- computational complexity
- k means
- computational cost
- dynamic programming
- cost function
- minimum spanning tree
- matching algorithm
- higher dimensional
- directed acyclic graph
- graph model
- graph theory
- graph construction
- optimal solution
- graph structure
- probabilistic model
- genetic algorithm
- theoretical analysis
- worst case