Reachability problems of random digraphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E81-A, Issue 12, 1998, Pages 2694-2702

  Uno, Yushi ^a   Ibaraki, Toshihide ^b  

^a Osaka Prefecture University   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

Random digraph; Reachability; Transitive closure; Upper and lower bounds on reachability

Indexed keywords

ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

RANDOM DIGRAPH; VERTEX REACHABILITY;

GRAPH THEORY;

EID: 0032315860     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. B. Bollobás, "Random Graphs," Academic Press, London, 1985.
2. B. Bollobás, "The chromatic number of random graphs," Combinatorica, vol.8, pp.49-55, 1988.
3. P. Erdos and J. Spencer, "Probabilistic Methods in Com-binatorics," Academic Press, New York, 1974.
4. J. Gimbel and E.M. Palmer, "Matching and cycle covers in random digraphs," Disc. Appl. Math., vol.34, pp.121-128, 1991.
5. I.B. Gertsbakh, "Epidemic processes on a random graph: some preliminary results," J. Applied Probability, vol.14, no.4, pp.427-438, 1977.
6. Y.E. loannidis and R. Ramakrishnan, "Efficient transitive closure algorithms," Proc. 14th Int'l Conf. on VLDB, pp.382-394, 1988.
7. H. Jakobsson, "Mixed-approach algorithms for transitive closure," Proc. 10th ACM SIGACT-SIGMOD-SIGART Symp. on PODS, pp.199-205, 1991.
8. R.J. Lipton and J.F. Naughton, "Query size estimation by adaptive sampling," Proc. 9th ACM SIGACT-SIGMOD-SIGART Symp. on PODS, pp.40-46, 1990.
9. H. Lu, "New strategies for computing the transitive closure of a database relation," Proc. 13th Int'l Conf. on VLDB, pp.267-274, 1987.
10. T. Nemetz and N. Kusolitsch, "A method of investigating the longest paths in certain random graphs," Annals of Probability, vol.11, pp.217-221, 1983.
11. C.P. Schnorr, "An algorithm for transitive closure with linear expected time," SI AM J. Computing, vol.7, pp. 127-133, 1978.
12. Y. Uno and T. Ibaraki, "Approximate evaluation to the size of transitive closures of relations," IPSJ Trans., vol.35, pp. 1493-1950, 1994.
13. Y. Uno, "Studies on optimization of query processing in deductive databases," Ph.D. Thesis, Kyoto University, 1995.