Efficient computation of the transitive closure size
Authors:
- 1 March 2018
- journal article
- research article
- Published by Springer Nature in Cluster Computing
- Vol. 22 (S3) , 6517-6527
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation of China (61472339, 61303040, 61572421, 61272124)
- Shanghai Alliance Program (LM201552)
- Shanghai University of Engineering and Technology School-Enterprise cooperation projects (DZ-025)
This publication has 22 references indexed in Scilit:
- Reachability queries on large dynamic graphs2014
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphsAnnals of Mathematics and Artificial Intelligence, 2013
- Computing transitive closure of bipolar weighted digraphsDiscrete Applied Mathematics, 2013
- Parallel transitive closure algorithmJournal of the Brazilian Computer Society, 2012
- An experimental study of algorithms for fully dynamic transitive closureACM Journal of Experimental Algorithmics, 2008
- A faster and simpler fully dynamic transitive closureACM Transactions on Algorithms, 2008
- Fast Dynamic Transitive Closure with LookaheadAlgorithmica, 2008
- An improved algorithm for transitive closure on acyclic digraphsTheoretical Computer Science, 1988
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972