Mixed-approach algorithms for transitive closure

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 1991, Pages 199-205

  Jakobsson, Hâkan ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DIRECTED GRAPHS;

LOWER BOUNDS; MIXED APPROACH; PAIRWISE CONNECTIVITIES; REACHABILITY TREE; TRANSITIVE CLOSURE; UPPER BOUND;

TREES (MATHEMATICS);

EID: 84988217646     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/113413.113431     Document Type: Conference Paper

References (15)

1. Aho, A.V., Hopcroft, J. ., Ullman, J.D., The Design and Analysis of Computer Al-goiithms, A d dison-Wesley, Reading, Mass.,1 74.
2. Bancilhon, F., "Naive evaluation of recursively defined relations," in On Knowledge Base Management Systems, (M . L. Brodie and J. Mylopoulos, eds.). Springer-Verlag, New York, 1986.
3. Bloniarz, P.A., Fischer, M.J., Meyer, A.R., "Anoteon the average time to compute tran-sitive closures, " Automata, Languages and Programming, Michael son and Milner, eds., Edinburgh University Press, Edinburgh, 1976.
4. Coppersmith, D ., Winograd, S., " Matrix multiplication via arithmetic progression, " Proc. 19th ACM Symp. on Theory of Computing, pp 1-6, 1987.
5. Dzikiewicz, J. " A n algorithm for finding the transitive closure of a digraph," Computing 15, pp. 75-79, 1975.
6. Ebert, J . " A sensitive transitive closureal-gorithm, " Inf Proc. Letters 12, pp. 255 - 258, 1981.
7. Loannidis, Y. E., Ramakrishnan, R., "Efficient transitive closure algorithms," Pioc. of the 14th International VLDB Conference, 1988.
8. Italiano, G. F., "Amortized efficiency of a path retrieval data structure," Theoretical Computer Science 48(2,3), pp. 273-281, 1986.
9. Italiano, G. F., "Finding paths and deleting edges in directed acyclic graphs," Info. Proc. Letters 28(1), pp. 5-11, 1988.
10. Munro, I ., "Efficient determination of the transitive closure of a directed graph," Inf. Proc. Letters 1(2), pp. 56-58, 1971.
11. Purdom, P., "A transitive closure algorithm," BIT 10 pp. 76-94, 1970.
12. Schnorr, C. P., " A n algorithm for transitive closure w i t h linear expected time," SIAM J. Comput. 7, pp. 127-133, 1978.
13. Schmitz, L ., " An improved transitive closure algorithm, " Computing 30, pp . 359 - 371, 1983.
14. Warshall, S., "A theorem on Boolean matri-ces," J. A C M 9(1), pp. 11-12, 1962.
15. Warre. "A modification of Warshall's algorithm for the transitive closure of binary relations," C. ACM 18(4), pp. 218-220, 1975.