On the time-space complexity of reachability queries for preprocessed graphs (Q916395)
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: On the time-space complexity of reachability queries for preprocessed graphs |
scientific article; zbMATH DE number 4153891
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the time-space complexity of reachability queries for preprocessed graphs |
scientific article; zbMATH DE number 4153891 |
Statements
On the time-space complexity of reachability queries for preprocessed graphs (English)
0 references
1990
0 references
computational complexity
0 references
graph reachability
0 references
time-space trade-offs
0 references
preprocessing
0 references
