Bowen Zhou, Bing Xiang, et al.
SSST 2008
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
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013