| 2 (2009) | |||||||||||||||
Abstract | |||||||||||||||
| wraparound. The former result is surprising, since it contradicts the prior "folklore " belief that the bisection width is n. We also show that every set of k nodes has at least k 2 log k (1\Gamma o(1)) neighbors in a butterfly without wraparound, and at least k log k (1\Gamma o(1)) | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||