Size-Estimation Framework with Applications to Transitive Closure and Reachability
- 1 December 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 55 (3) , 441-453
- https://doi.org/10.1006/jcss.1997.1534
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A linear-processor polylog-time algorithm for shortest paths in planar graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On optimizing multiplications of sparse matricesPublished by Springer Nature ,1996
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphsJournal of Computer and System Sciences, 1993
- A contraction procedure for planar directed graphsPublished by Association for Computing Machinery (ACM) ,1992
- On tree-based techniques for query evaluationPublished by Association for Computing Machinery (ACM) ,1992
- Mixed-approach algorithms for transitive closure (extended abstract)Published by Association for Computing Machinery (ACM) ,1991
- Query size estimation by adaptive sampling (extended abstract)Published by Association for Computing Machinery (ACM) ,1990
- Parallel Depth-First Search in General Directed GraphsSIAM Journal on Computing, 1990
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952