The transitive closure of a random digraph

Random Structures & Algorithms

Volumn 1, Issue 1, 1990, Pages 73-93

  Karp, Richard M ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84990713780     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.3240010106     Document Type: Article

References (9)

1. On the strong connectedness of directed random graphs
2. On the connectivity of random m‐orientable graphs and digraphs
3. An algorithm for transitive closure with linear expected time
4. The asymptotic analysis of a stochastic model of an epidemic