25,161
edits
Changes
m
A De Bruijn graph is a directed graph representing overlaps between sequences of symbols <ref>[https://en.wikipedia.org/wiki/De_Bruijn_graph De Bruijn graph from Wikipedia]</ref> .
So called De Bruijn Networks with the topology of De Bruijn Graphs have interesting properties in processor and computer networks, for instance as described by [[Rainer Feldmann|Feldmann et al.]] to connect [[Transputer]] networks <ref>[[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1991'''). ''A Fully Distributed Chess Program''. [[Advances in Computer Chess 6]], [http://www.top-5000.nl/ps/A%20fully%20distribuited%20chess%20program.pdf pdf]</ref> <ref>[[Rainer Feldmann]] ('''1993'''). ''Game Tree Search on Massively Parallel Systems'' Phd-Thesis, [http://wwwcs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.pdf pdf]</ref> .
no edit summary
<span id="DeBruijnGraphs"></span>
=De Bruijn Graphs=
* Each vertex has exactly m incoming and m outgoing edges
* Each n-dimensional de Bruijn graph is the [https://en.wikipedia.org/wiki/Line_graph line digraph] of the (n-1)-dimensional de Bruijn graph
=De Bruijn Networks=
=See also=
