Robert E. Donovan
INTERSPEECH - Eurospeech 2001
The diameter of a class of random directed graphs in which the outdegree of each vertex is constrained to be exactly k is examined. Vertices connect themselves to k other distinct vertices with outwardly directed edges, all possible sets of k vertices being chosen with equal probability. It is shown that the diameter of such a random graph almost surely takes on only one of two values. © 1990 IEEE
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008