Graph-theoretic methods in database theory
- 2 April 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 230-242
- https://doi.org/10.1145/298514.298576
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- An improved parallel algorithm that computes the BFS numbering of a directed graphInformation Processing Letters, 1988
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- Parallel evaluation of the transitive closure of a database relationInternational Journal of Parallel Programming, 1988
- Dynamic cycle detectionInformation Processing Letters, 1983
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Fast Algorithms for Solving Path ProblemsJournal of the ACM, 1981
- Operations on sparse relationsCommunications of the ACM, 1977
- A modification of Warshall's algorithm for the transitive closure of binary relationsCommunications of the ACM, 1975
- General context-free recognition in less than cubic timeJournal of Computer and System Sciences, 1975
- Organizing matrices and matrix operations for paged memory systemsCommunications of the ACM, 1969