Francois Pellegrini, "Bounds for the bandwidth of the d-ary de Bruijn graph", RR-366-93, LaBRI, URA CNRS 1304, Universit'e Bordeaux I, 1993. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
De Bruijn Networks - Quesnel (1995) (2 citations) (Correct)
....basis of multicomputer interconnection networks. We ll explore various characteristics that make de Bruijn graphs attractive. 1 Introduction Some motivation for the study of novel network topologies comes from the theoretical satisfaction of working on graph and group theoretic objects, as in [1], 4] and [3] On a practical level, though, there are algorithmic synergies, as in [6] and favourable VLSI implementation characteristics, as in [2] and [5] 1.1 Some Topological Considerations Before we look at de Bruijn networks let s consider some topological issues. Optimal tilings in ....
Francois Pellegrini, "Bounds for the bandwidth of the d-ary de Bruijn graph", RR-366-93, LaBRI, URA CNRS 1304, Universit'e Bordeaux I, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC