On the time-space complexity of reachability queries for preprocessed graphs (Q916395)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the time-space complexity of reachability queries for preprocessed graphs |
scientific article |
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
