Old Web
English
Sign In
Acemap
>
Paper
>
O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem.
O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem.
2018
Ryo Ashida
Kotaro Nakagawa
Keywords:
Discrete mathematics
Reachability problem
Lattice graph
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]