Title :
Directed Planar Reachability is in Unambiguous Log-Space
Author :
Bourke, Chris ; Tewari, Raghunath ; Vinodchandran, N.V.
Author_Institution :
Univ. of Nebraska, Lincoln
Abstract :
We show that the st-connectivity problem for directed planar graphs can be decided in unambiguous logarithmic space.
Keywords :
directed graphs; reachability analysis; directed planar reachability; st-connectivity problem; unambiguous logarithmic space; Circuits; Complexity theory; Computational complexity; Computer science; Joining processes; Upper bound;
Conference_Titel :
Computational Complexity, 2007. CCC '07. Twenty-Second Annual IEEE Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
0-7695-2780-9
