Amortized efficiency of a path retrieval data structure
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 48, 273-281
- https://doi.org/10.1016/0304-3975(86)90098-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Minimal Representation of Directed HypergraphsSIAM Journal on Computing, 1986
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- On-line computation of transitive closures of graphsInformation Processing Letters, 1983
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981