A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity (Q4210095): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539793283151 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2149392423 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:56, 30 July 2024
scientific article; zbMATH DE number 1200727
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity |
scientific article; zbMATH DE number 1200727 |
Statements
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity (English)
0 references
20 September 1998
0 references
connectivity
0 references
reachability
0 references
time-space tradeoff
0 references
polynomial time algorithm
0 references
path
0 references
