Date: 11 Oct 2005

StUSPACE(log n) ⊂-DSPACE(log2 n/log log n)

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.