An O(log n log log n) space algorithm for undirected st-connectivity

Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorithm of Chong and Lam [6], an approach suggested by Prof. Vijaya Ramachandran, and uses the universal exploration sequences for trees constructed by Kouck?y [13]. Our result improves the O(log4/3 n) bound of Armoni et al. [2] and is a big step towards the optimal O(log n). Independently of our result and using a different set of techniques, the optimal bound was achieved by Reingold [18]. Key words. undirected st-connectivity, space-bounded computation AMS subject classifications. 05C40, 05C85, 68Q25, 68Q15

• Type: Conference
• Year: 2005
• Where: STOC
• Authors: Vladimir Trifonov
• Keywords: Algorithms, Deterministic Erew Algorithm, Optimal Bound, Optimal O(log N, STOC 2005