RUSPACE(log n) \(\subseteq\) DSPACE(log2 n/log log n)
- 112 Downloads
We present a deterministic algorithm running in space O(log2 n /log log n ) solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n ) time-bounded algorithm for this problem running on a parallel pointer machine.
KeywordsDeterministic Algorithm Connectivity Problem Parallel Pointer Pointer Machine
Unable to display preview. Download preview PDF.