(Q3066095)

English

De Bruijn graph

node-link graph representing overlaps between sequences of symbols

In more languages

Statements

mathematical concept

0 references

0 references

De Bruijin digraph.png
229 × 415; 6 KB

0 references

Nicolaas Govert de Bruijn

0 references

0 references

defining formula

V=S^{n}=\{(s_{1},\dots ,s_{1},s_{1}),(s_{1},\dots ,s_{1},s_{2}),\dots ,(s_{1},\dots ,s_{1},s_{m}),(s_{1},\dots ,s_{2},s_{1}),\dots ,(s_{m},\dots ,s_{m},s_{m})\}

1 reference

imported from Wikimedia project

English Wikipedia

maintained by WikiProject

WikiProject Mathematics

0 references

Commons category

De Bruijn graphs

0 references

Identifiers

1 reference

Freebase Data Dumps

publication date

28 October 2013

1 reference

imported from Wikimedia project

English Wikipedia

Microsoft Academic ID

0 references

1 reference

26 January 2022

https://docs.openalex.org/download-snapshot/snapshot-data-format

Sitelinks

Wikipedia(8 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(1 entry)

commonswiki Category:De Bruijn graphs

Retrieved from "https://www.wikidata.org/w/index.php?title=Q3066095&oldid=1960907123"