De bruijn graph arcs

dc.contributor	Universidade Estadual Paulista (UNESP)
dc.creator	Schreiber, Michael
dc.date	2011-05-26T19:52:41Z
dc.date	2011-05-26T19:52:41Z
dc.date	2011-05-26
dc.date.accessioned	2017-04-05T16:55:46Z
dc.date.available	2017-04-05T16:55:46Z
dc.identifier	http://acervodigital.unesp.br/handle/123456789/3715
dc.identifier	http://objetoseducacionais2.mec.gov.br/handle/mec/6066
dc.identifier.uri	http://repositorioslatinoamericanos.uchile.cl/handle/2250/831126
dc.description	Knowledge about coding theory, computer science and graph theory
dc.description	De Bruijn sequences contain all sequences of a given length n from a given alphabet. The integers corresponding to the indices of characters in their alphabet cover the range 0 to b^n-1. These integers are arranged on a half circle, and the Euler cycle visiting all edges of the graph is shown by arcs. The blue arcs connect lower to higher integers and the red arcs connect higher to lower integers. Tooltips for points show the enumerated integers. Tooltips for arcs give the connections between lists of digits as rules
dc.description	Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
dc.relation	172DeBruijnGraphArcs.nbp
dc.rights	Demonstration freeware using Mathematica Player
dc.subject	Computer Science
dc.subject	Graph Theory
dc.subject	Educação Superior::Ciências Exatas e da Terra::Matemática::Geometria e Topologia
dc.title	De bruijn graph arcs
dc.type	Software