A spanning tree transitive closure algorithm
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Aggregative closure: an extension of transitive closurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A suitable algorithm for computing partial transitive closures in databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A compression technique to materialize transitive closureACM Transactions on Database Systems, 1990
- Direct transitive closure algorithms: design and performance evaluationACM Transactions on Database Systems, 1990
- Alpha: an extension of relational algebra to express a class of recursive queriesIEEE Transactions on Software Engineering, 1988
- A study of transitive closure as a recursion mechanismPublished by Association for Computing Machinery (ACM) ,1987
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- A sensitive transitive closure algorithmInformation Processing Letters, 1981
- On computing the transitive closure of a relationActa Informatica, 1977
- A Theorem on Boolean MatricesJournal of the ACM, 1962