A data structure for arc insertion and regular path finding
- 1 June 1991
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 3 (2), 187-210
- https://doi.org/10.1007/bf01530925
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- Counting methods for cyclic relationsPublished by Association for Computing Machinery (ACM) ,1988
- One-sided recursionsPublished by Association for Computing Machinery (ACM) ,1987
- Bounds on the propagation of selection into logic programsPublished by Association for Computing Machinery (ACM) ,1987
- Maintenance of stratified databases viewed as a belief revision systemPublished by Association for Computing Machinery (ACM) ,1987
- Worst-case complexity analysis of methods for logic query implementationPublished by Association for Computing Machinery (ACM) ,1987
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- An amateur's introduction to recursive query processing strategiesPublished by Association for Computing Machinery (ACM) ,1986
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- On-line computation of transitive closures of graphsInformation Processing Letters, 1983