3 search results - page 1 / 1 » Directed Planar Reachability is in Unambiguous Log-Space |
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
FCT
2009
Springer
13 years 9 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
COCO
2010
Springer
13 years 9 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...