✦ LIBER ✦

Some VLSI decompositions of the de Bruijn graph

✍ Scribed by Sam Dolinar; Tsz-Mei Ko; Robert McEliece

Book ID: 103060215
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 631 KB
Volume: 106-107
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90546-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extension of de Bruijn graph and Kautz g

Extension of de Bruijn graph and Kautz graph

✍ Y. Shibata; Y. Gonda 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 560 KB

On the connectivity of the De Bruijn gra

On the connectivity of the De Bruijn graph

✍ M.A. Sridhar 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 285 KB

On extremal factors of the de Bruijn gra

On extremal factors of the de Bruijn graph

✍ Abraham Lempel 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 526 KB

Wide diameters of de Bruijn graphs

✍ Jyhmin Kuo; Hung-Lin Fu 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 288 KB

2-diameter of de Bruijn graphs

✍ Li, Qiao; Sotteau, Dominique; Xu, Junming 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 589 KB

This paper shows that in the undirected binary de Bruijn graph of dimension n . UB(n), which has diameter n , there exist at least two internally vertex disjoint paths of length at most n between any two vertices. In other words, the 2-diameter of U B ( n ) is equal to its diameter n .

Independence number of de Bruijn graphs

✍ Nicolas Lichiardopol 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 264 KB