Conference paper
Some experimental results on placement techniques
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
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
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev