pdfformat: 

@InProceedings{ashida_et_al:LIPIcs:2018:8718, author = {Ryo Ashida and Kotaro Nakagawa}, title = {{O~(n^{1/3})Space Algorithm for the Grid Graph Reachability Problem}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {5:15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770668}, ISSN = {18688969}, year = {2018}, volume = {99}, editor = {Bettina Speckmann and Csaba D. T{\'o}th}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8718}, URN = {urn:nbn:de:0030drops87182}, doi = {10.4230/LIPIcs.SoCG.2018.5}, annote = {Keywords: graph reachability, grid graph, graph algorithm, sublinear space algorithm} }
Keywords:  graph reachability, grid graph, graph algorithm, sublinear space algorithm  
Seminar:  34th International Symposium on Computational Geometry (SoCG 2018)  
Issue date:  2018  
Date of publication:  08.06.2018 