Work

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

Year: 2000
Type: article
Abstract: 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].
Language: English
Open Access status: bronze
OpenAlex ID: W1995273909
FWCI: 1.209
Cites: 14
Cited by: 39
Related to: 10