An <i>O</i> (log( <i>n</i> ) <sup>4/3</sup> ) space algorithm for ( <i>s, t</i> ) connectivity in undirected graphs (Q5385338)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O (log( n ) 4/3 ) space algorithm for ( s, t ) connectivity in undirected graphs |
scientific article; zbMATH DE number 5271289
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i> (log( <i>n</i> ) <sup>4/3</sup> ) space algorithm for ( <i>s, t</i> ) connectivity in undirected graphs |
scientific article; zbMATH DE number 5271289 |
Statements
An <i>O</i> (log( <i>n</i> ) <sup>4/3</sup> ) space algorithm for ( <i>s, t</i> ) connectivity in undirected graphs (English)
0 references
5 May 2008
0 references
