B. Bollob'as. The diameter of random graphs. Transactions of the ameerican mathematical society, 267(1):41--51, September 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Message Passing Model for Communication on Random.. - Bieniek, Nölle, Schreiber (1996) (1 citation) (Correct)
....measured average path length from implemented graphs. In Fig. 4 the average number of nodes with distance i, i.e. NP i (D) is compared. B. Diameter In the Theory of random graphs almost every graph has property P if the probability that a graph does not have property P tends to 0 with n 1 ([3], 5] The following asymptotic bounds for the diameter of random r regular graphs are proven in [4] 5] cf. Fig 5) Theorem 1: Let r 3 and ffl 0 be fixed and let d = d(n) be the least integer satisfying (r Gamma 1) d Gamma1 (2 ffl)rn log n: Then almost every r regular graph of ....
B. Bollob'as. The diameter of random graphs. Transactions of the ameerican mathematical society, 267(1):41--51, September 1981.
A Message Passing Model for Communication on Random.. - Bieniek, Nölle, Schreiber (1996) (1 citation) (Correct)
....measured average path length from implemented graphs. In Fig. 4 the average number of nodes with distance i, i.e. NP i (D) is compared. B. Diameter In the Theory of random graphs almost every graph has property P if the probability that a graph does not have property P tends to 0 with n 1 ([3], 5] The following asymptotic bounds for the diameter of random r regular graphs are proven in [4] 5] cf. Fig 5) Theorem 1: Let r 3 and ffl 0 be fixed and let d = d(n) be the least integer satisfying (r Gamma 1) d Gamma1 (2 ffl)rn log n: 4 Then almost every r regular graph of ....
B. Bollob'as. The diameter of random graphs. Transactions of the ameerican mathematical society, 267(1):41--51, September 1981.
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