### Table 1 Comparative values of the broadcast time of cycle pre x digraphs, (? (3)), and de Bruijn digraphs of diameter three, 0(B( ; 3)), for small values of the degree.

2003

Cited by 2

### Table 3: Upper bounds on the order of digraphs of degree d and diameter k.

2005

Cited by 7

### Table 1: Approaching the Moore limit

1995

"... In PAGE 6: ...Table 1: Approaching the Moore limit Table1 shows the results obtained as the Moore limit of 40 processors was approached. It can be seen that for this particular case of diameter 3 con gurations, where the Moore limit is 40 processors, the problem gets harder the nearer the Moore limit.... ..."

Cited by 3

### Table 1: Approaching the Moore limit

1995

"... In PAGE 6: ...Table 1: Approaching the Moore limit Table1 shows the results obtained as the Moore limit of 40 processors was approached. It can be seen that for this particular case of diameter 3 con#0Cgurations, where the Moore limit is 40 processors, the problem gets harder the nearer the Moore limit.... ..."

Cited by 2

### Table 1: Comparison of diameters

"... In PAGE 11: ... All processors have four links available for interconnection, except the two processors connected to the system controller which have only three links available. Table1 shows the diameters of the AMPBest, AMPWorst and AMPDFS con gurations, along with those of the AMP con gurations generated by the GA (labelled AMPGA).... ..."

### Table 3. Largest known vertex symmetric n28n01;Dn29 digraphs

"... In PAGE 6: ... These digraphs can be obtained from the complete digraph on n01 + 1 vertices n28no loopsn29 by line digraph iteration. For i n15 4 the n282;in29 digraphs in Table3 are obtained by line digraph iteration from a n282; 4n29 digraph on 25 vertices found by computer search n5b28n5d. No improvements have been made on this list since 1984.... In PAGE 6: ... Orders of largest known n28n01;Dn29 digraphs Recent studies have also focussed on the degreen2fdiameter problem for vertex symmetric digraphs n5b26, 21, 27, 14n5d. In Table3 we collect the current state of this problem, highlighting our new results by bold numbers. Details of the new digraphs... In PAGE 7: ... The small number of elements with distance 5 might create the hope that a `better apos; choice of generators would lead to a digraph of diameter 4 on 168 vertices. The annotations in Table3... ..."

### Table 1. H(p; q; 2) with diameter 8 and 9.

2000

"... In PAGE 4: ...ly of digraphs H(p; q; d) (i.e., the d-regular digraph built from an OTIS(p; q), with n = pq=d ver- tices and vertex set Zn, in which the d transmitters (b(du + )=qc ; du + mod q), 2 Zd, and the d re- ceivers (b(du + )=pc ; du + mod p), 2 Zd, be- long to the node u 2 Zn). We obtained, by exhaustive search, the results reported in Table1 for degree 2 and diameters 8 and 9. The table contains only the largest digraphs found for each diameter.... ..."

Cited by 1

### Table 2. Comparison of three traditional IR - user studies.

"... In PAGE 15: ... According to data from the Millsap and Ferl (1993) study, session length was in the range of two to five queries per session. Comparison of Searches Using data from Table 1, Table2 , and Table 3, one can develop broad picture of a typical search on each system. This data is presented in Table 4.... ..."

### Table 1: H(p; q; 2) with diameter 8, 9 and 10.

1999

"... In PAGE 13: ...amily of digraphs H(p; q; d) (i.e., the digraph of degree d built from an OTIS(p; q)). We obtained, by exhaustive search, the results reported in Table1 for degree 2 and diameters 8, 9, and 10. The table contains only the largest digraphs found for each diameter.... ..."

Cited by 1