| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419048 | Discrete Applied Mathematics | 2014 | 6 Pages |
Abstract
The aim of this paper is to generalize the Congestion Lemma, which has been considered an efficient tool to compute the minimum wirelength (Manuel et al., 2009) and thereby obtain the minimum wirelength of embedding hypercubes into sibling trees.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Micheal Arockiaraj, Jasintha Quadras, Indra Rajasingh, Arul Jeya Shalini,