Vivek
Created page with "Solving mazes is a computational problem appearing in a wide range of situations - starting from puzzles, social networks and system verification applications. The fundamental abstraction of this problem is the graph reachability problem which asks if given a graph G and two special vertices s and t, is t reachable from s or not? The question of whether or not this problem can be solved using space that is logarithmic in the number of vertices, encapsulates the centre st..."