|
Published Articles >> Table of Contents >> Abstract
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
pp. 217-221
Directed Planar Reachability is in Unambiguous Log-Space
1 Bourke, University of Nebraska, Lincoln, USA
1 Tewari, University of Nebraska, Lincoln, USA
1 Vinodchandran, University of Nebraska, Lincoln, USA
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2007.9
Send link to a friend
| Abstract |
|
We show that the st-connectivity problem for directed planar graphs can be decided in unambiguous logarithmic space.
|
 Additional Information
|
Citation:
1 Bourke, 1 Tewari, 1 Vinodchandran,
"Directed Planar Reachability is in Unambiguous Log-Space,"
ccc,
pp. 217-221,
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07),
2007
|
|
