Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 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
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013