Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
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
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014