Embedding of hypercubes into sibling trees

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2014-05, Vol.169, p.9-14
Hauptverfasser: Arockiaraj, Micheal, Quadras, Jasintha, Rajasingh, Indra, Shalini, Arul Jeya
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2014.01.002