Directed Planar Reachability is in Unambiguous Log-Space

Download PDF
Open Webpage

Chris Bourke, Raghunath Tewari, N. V. Vinodchandran

Published: 01 Jan 2007, Last Modified: 01 Oct 2024CCC 2007EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We show that the st-connectivity problem for directed planar graphs can be decided in unambiguous logarithmic space.