Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
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
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Daniel M. Bikel, Vittorio Castelli
ACL 2008