On the time-space complexity of reachability queries for preprocessed graphs (Q916395): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Efficient searching using partial ordering / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower Bounds on the Complexity of Some Optimal Data Structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Lower Bound on the Complexity of Orthogonal Range Queries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of Maintaining an Array and Computing Its Partial Sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Query time versus redundancy trade-offs for range queries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of 2-output Boolean networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Should Tables Be Sorted? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Complexity of Maintaining Partial Sums / rank | |||
Normal rank |
Latest revision as of 09:50, 21 June 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