Faster Walks in Graphs: A <i>Õ</i>(<i>n</i><sup>2</sup>) Time-Space Trade-off for Undirected <i>s-t</i> Connectivity (Q5741843): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1204.1136 / rank | |||
Normal rank | |||
Latest revision as of 03:57, 20 April 2024
scientific article; zbMATH DE number 7055368
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster Walks in Graphs: A <i>Õ</i>(<i>n</i><sup>2</sup>) Time-Space Trade-off for Undirected <i>s-t</i> Connectivity |
scientific article; zbMATH DE number 7055368 |
Statements
Faster Walks in Graphs: A <i>Õ</i>(<i>n</i><sup>2</sup>) Time-Space Trade-off for Undirected <i>s-t</i> Connectivity (English)
0 references
15 May 2019
0 references
