Article ID Journal Published Year Pages File Type
420095 Discrete Applied Mathematics 2012 9 Pages PDF
Abstract

A lot of research has been devoted to finding efficient embedding of trees into hypercubes. On the other hand, in this paper, we consider the problem of embedding hypercubes into kk-rooted complete binary trees, kk-rooted sibling trees, binomial trees and certain classes of caterpillars to minimize the wirelength.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Wirelength of hypercubes into certain trees
Authors
, , , ,