On-line computation of transitive closures of graphs
- 26 February 1983
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 16 (2) , 95-97
- https://doi.org/10.1016/0020-0190(83)90033-9
Abstract
No abstract availableFunding Information
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 5 references indexed in Scilit:
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Boolean matrix multiplication using only O(n log 2 7 log n) bit operationsACM SIGACT News, 1977
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- Gaussian elimination is not optimalNumerische Mathematik, 1969