The transitive closure of a random digraph
- 1 March 1990
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 1 (1) , 73-93
- https://doi.org/10.1002/rsa.3240010106
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- On the connectivity of randomm-orientable graphs and digraphsCombinatorica, 1982
- An Algorithm for Transitive Closure with Linear Expected TimeSIAM Journal on Computing, 1978
- Branching ProcessesPublished by Springer Nature ,1972
- The Asymptotic Analysis of a Stochastic Model of an EpidemicTheory of Probability and Its Applications, 1970
- The Theory of Branching ProcessesPublished by Springer Nature ,1963