### Table 1: Speedup of TSPLib instances on processor net- works with De Bruijn topology

"... In PAGE 7: ... For a ring we can only achieve good speed-up up to 64 processors. Table1 and 2 show the speedup results on De Bruijn networks. Speed-ups are computed dividing sequential time on one transputer by parallel time in- cluding all extra work of the parallel implementation.... ..."

### Table 10. Equicut of DeBruijn networks.

1997

"... In PAGE 21: ... It can be modeled as a graph bisection problem in an unweighted planar graph. The results for the de Bruijn networks in Table10 show that the running times are comparable to the ones in Subsection 5.... ..."

Cited by 20

### Table 10. Equicut of DeBruijn networks.

"... In PAGE 21: ... It can be modeled as a graph bisection problem in an unweighted planar graph. The results for the de Bruijn networks in Table10 show that the running times are comparable to the ones in Subsection 5.... ..."

### TABLE V Best FBC (bFBC) graphs and deBruijn graphs

### Table 0b. Performance Ratio vs. Initial Processor (de Bruijn, N = 64, b = 2, = 1).

1998

"... In PAGE 7: ... For the de Bruijn network, P1 is a good choice. Table0 a. Performance Ratio vs.... ..."

Cited by 1

### Table 1. A comparison of k-ary n-cubes versus de Bruijn graphs

2005

Cited by 1