| S. Kapidakis. Average-Case Analysis of Graph-Searching Algorithms. PhD thesis, Department of Computer Science, Princeton University, 1990. |
....p because each edge exists with probability p and there are n possible target nodes. Therefore the graph can be generated by computing for each node i the number e i of edges leaving node i by using binomial distribution and then randomly choosing e i distinct target nodes for those edges (see [5]; a fast algorithm for computing binomially distributed random numbers is presented in [10] 2. Random dags D(n; p) Parameters n and p are similar to those of the general directed random graphs. The generation of a random dag is similar to the generation of a general random graph, but the nodes ....
.... general (cyclic) 2 We do not know whether these results have been shown analytically, but similar results has been shown about the number of accessible nodes when searching an undirected or a directed random graph, and about the number and sizes of components in undirected random graphs, see [3, 5] (a) 1 2 3 4 5 6 7 8 9 10 np 100 300 1000 3000 10000 30000 n 0.0 0.2 0.4 0.6 0.8 1.0 1 2 3 4 5 6 7 8 9 10 np 100 300 1000 3000 10000 30000 n 0.0 0.2 0.4 0.6 0.8 1.0 (b) 1 2 3 4 5 6 7 8 9 10 np 100 300 1000 3000 10000 30000 n 0.0 0.2 0.4 0.6 0.8 1.0 1 2 3 4 5 6 7 8 9 10 np 100 300 1000 ....
S.Kapidakis, Average-Case Analysis of Graphs-Searching Algorithms, PhD Thesis, Report CS-TR-286-90, Princeton University, Department of Computer Science, October 1990.
No context found.
S. Kapidakis. Average-Case Analysis of Graph-Searching Algorithms. PhD thesis, Department of Computer Science, Princeton University, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC