On the time-space complexity of reachability queries for preprocessed graphs
- 1 August 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 35 (5) , 261-267
- https://doi.org/10.1016/0020-0190(90)90055-3
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- On the Complexity of Maintaining Partial SumsSIAM Journal on Computing, 1985
- The Complexity of Maintaining an Array and Computing Its Partial SumsJournal of the ACM, 1982
- On the complexity of 2-output Boolean networksTheoretical Computer Science, 1981
- Query time versus redundancy trade-offs for range queriesJournal of Computer and System Sciences, 1981
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- Should Tables Be Sorted?Journal of the ACM, 1981
- Efficient searching using partial orderingInformation Processing Letters, 1981
- Lower Bounds on the Complexity of Some Optimal Data StructuresSIAM Journal on Computing, 1981