Reconfiguration of Complete Binary Trees in Full IEH Graphs and Faulty Hypercubes

The incrementally extensible hypercube (IEH) graph is a generalization of binary hypercube networks in that the number of nodes can be arbitrary in contrast to a strict power of 2. In this paper, the authors present an efficient model to fulfill the embedding of a full binary tree into a full IEH gr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The international journal of high performance computing applications 2001-04, Vol.15 (1), p.47-55
Hauptverfasser:	Lin, Jen-Chih, Keh, Huan-Chao
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computer based modeling Graphs Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!