On the time-space complexity of reachability queries for preprocessed graphs (Q916395): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 18:15, 30 January 2024
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