33 search results - page 1 / 7 » On the Power of Unambiguity in Logspace |
56
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
CORR
2008
Springer
15 years 1 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
99
Voted
COCO
2007
Springer
15 years 7 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....
125
Voted
FCT
2009
Springer
15 years 5 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...
106
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...