The purpose of this paper is to study the deterministic
{\em isolation} for certain structures in directed and undirected
planar graphs.
The motivation behind this work is a recent development on this topic. For example, \cite{btv07} isolate a directed path in planar graphs and
\cite{dkr08} isolate a perfect matching in ...
more >>>
One of the central questions in space complexity is whether nondeterministic logspace computations (NL) can be simulated in unambiguous logspace (UL). A stronger notion, reach unambiguity (RUL $\subseteq$ UL $\cap$ coUL), requires every configuration reachable from the start to have exactly one computation path (Buntrock et.al. 91). While directed graph ... more >>>