Name
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 k-rooted complete binary trees, k-rooted sibling trees, binomial trees and certain classes of caterpillars to minimize the wirelength. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.dam.2011.12.007 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
efficient embedding,k-rooted complete binary tree,certain class,binomial tree,k-rooted sibling tree,certain tree,embedding hypercubes,embedding,hypercubes | Journal | 160 |
Issue | ISSN | Citations |
18 | 0166-218X | 7 |
PageRank | References | Authors |
0.48 | 24 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Indra Rajasingh | 1 | 193 | 24.17 |
| Paul Manuel | 2 | 221 | 17.42 |
| Bharati Rajan | 3 | 135 | 12.91 |
| Micheal Arockiaraj | 4 | 58 | 8.88 |