DeepAI AI Chat
Log In Sign Up

Õ(n^1/3)-Space Algorithm for the Grid Graph Reachability Problem

by   Ryo Ashida, et al.
Tokyo Institute of Technology

The directed graph reachability problem takes as input an n-vertex directed graph G=(V,E), and two distinguished vertices s and t. The problem is to determine whether there exists a path from s to t in G. This is a canonical complete problem for class NL. Asano et al. proposed an Õ(√(n)) space and polynomial time algorithm for the directed grid and planar graph reachability problem. The main result of this paper is to show that the directed graph reachability problem restricted to grid graphs can be solved in polynomial time using only Õ(n^1/3) space.


page 1

page 2

page 3

page 4


Grid Graph Reachability

The reachability problem is to determine if there exists a path from one...

Frameworks for Designing In-place Graph Algorithms

Read-only memory model is a classical model of computation to study time...

Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability

The discrete Fréchet distance is a popular measure for comparing polygon...

Space-Efficient Algorithms for Reachability in Geometric Graphs

The problem of graph Reachability is to decide whether there is a path f...

Benchmarks of Extended Basis Reachability Graphs

In this note, we want to provide a comparison among the efficiency of di...

Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs

A rotor walk in a directed graph can be thought of as a deterministic ve...

The Lattice-Theoretic Essence of Property Directed Reachability Analysis

We present LT-PDR, a lattice-theoretic generalization of Bradley's prope...