S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
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
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University