Presentation 2001/1/15
On VLSI Decompositions for d-ary de Bruijn Graphs
Tadashi NISHIYAMA, Toshinori YAMADA, Shuichi UENO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A VLSI decomposition of a graph G is collection of isomorphic vertex-disjoint subgraphs(called building blocks)of G which together span G. This paper shows that some known results for building blocks of binary de Bruijn graphs can be naturally generalized for d-ary de Bruijn graphs. We show nacessary conditions and sufficient conditions for a graph to be a building block for d-ary de Bruijn graphs. We also show building blocks for d-ary de Bruijn graphs with asymptotically optimal efficiency.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) VLSI decomposition / universal building block / de Bruijn graph
Paper # COMP2000-70
Date of Issue

Conference Information
Committee COMP
Conference Date 2001/1/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On VLSI Decompositions for d-ary de Bruijn Graphs
Sub Title (in English)
Keyword(1) VLSI decomposition
Keyword(2) universal building block
Keyword(3) de Bruijn graph
1st Author's Name Tadashi NISHIYAMA
1st Author's Affiliation Dept.of Communications and Integrated Systems, Graduate School of Science and Engineering, Tokyo Institute of Technology()
2nd Author's Name Toshinori YAMADA
2nd Author's Affiliation Dept.of Communications and Integrated Systems, Graduate School of Science and Engineering, Tokyo Institute of Technology
3rd Author's Name Shuichi UENO
3rd Author's Affiliation Dept.of Communications and Integrated Systems, Graduate School of Science and Engineering, Tokyo Institute of Technology
Date 2001/1/15
Paper # COMP2000-70
Volume (vol) vol.100
Number (no) 568
Page pp.pp.-
#Pages 8
Date of Issue