On the Embedding of the De Bruijn Graphs
碩士 === 國立臺灣大學 === 資訊工程學系 === 86 === MICA是一種可以改變網路拓樸組態的平行架構。在本篇論文中,我們將以 一種叫做bounded graph contraction的圖論觀念為工具來探討平行網路 拓樸嵌入到MICA架構的問題。首先,我們找出了一些著名平行架構的 bounded contraction;接著,我們將證明de Bruijn圖的bounded contraction之下界(lower bound)為O...
Main Authors: | Lee, An-Che, 李安哲 |
---|---|
Other Authors: | Lyuu Yuh-Dauh |
Format: | Others |
Language: | en_US |
Published: |
1998
|
Online Access: | http://ndltd.ncl.edu.tw/handle/60824466673856429965 |
Similar Items
-
Covering the de Bruijn graph
by: Bryant, Roy Dale
Published: (2012) -
De Bruijn Graphs and Lamplighter Groups
by: Alharthy, Shathaa
Published: (2019) -
Diameters and Wide-Diameters of de Bruijn Graphs
by: Jyh-Min Kuo, et al.
Published: (2007) -
Constructing higher-order de Bruijn graphs
by: Hunt, D'Hania J.
Published: (2012) -
Fault-tolerant ring embedding in De Bruijn networks
by: Rowley, Robert A.
Published: (2012)