On the time-space complexity of reachability queries for preprocessed graphs

Authors:
L. Hellerstein;P. Klein;R. Wilber
Affiliations:
-;-;-
Venue:
Information Processing Letters
Year:
1990

Citing 0
Cited 3

On the analysis of indexing schemes

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On certificates and lookahead in dynamic graph problems

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Space Time Tradeoffs for Graph Properties

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.89

Visualization

Abstract