A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity (Q4210095)
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: A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity |
scientific article; zbMATH DE number 1200727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.864599347114563
0 references
0.837349534034729
0 references
0.8076662421226501
0 references
0.7959308624267578
0 references
