An O(log(n)(4/3)) space algorithm for (s, t) connectivity in undirected graphs

We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(log(4/3) n) space. This improves the previous O(log(3/2) n) bound of Nisan et al. {[}1992].