An <i>O</i> (log( <i>n</i> ) <sup>4/3</sup> ) space algorithm for ( <i>s, t</i> ) connectivity in undirected graphs (Q5385338): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q62398495 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/333979.333984 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1995273909 / rank | |||
Normal rank |
Latest revision as of 18:10, 19 March 2024
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