2026-07-21T03:15:32Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:11581 2024-03-06T10:48:22Z ddc:004 open_access

An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability Jain, Rahul Tewari, Raghunath graph reachability grid graph graph algorithm sublinear space algorithm The reachability problem is to determine if there exists a path from one vertex to another in a graph. Grid graphs are the class of graphs where vertices are present on the lattice points of a two-dimensional grid, and an edge can occur between a vertex and its immediate horizontal or vertical neighbor only. Asano et al. presented the first simultaneous time space bound for reachability in grid graphs by presenting an algorithm that solves the problem in polynomial time and O(n^(1/2 + epsilon)) space. In 2018, the space bound was improved to O~(n^(1/3)) by Ashida and Nakagawa. In this paper, we show that reachability in an n vertex grid graph can be decided by an algorithm using O(n^(1/4 + epsilon)) space and polynomial time simultaneously. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Rahul Jain and Raghunath Tewari 2019 Is Part Of LIPIcs, Volume 150, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2019.19 urn:nbn:de:0030-drops-115813 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.19 eng https://creativecommons.org/licenses/by/3.0/legalcode