Efficient Embeddings into Hypercube-like Topologies

Embeddings of various graph classes into hypercubes have been widely studied. Almost all these classes are regularly structured graphs such as meshes, complete trees or pyramids. In this paper, we present a general method for one-to-one embeddings of irregularly structured graphs into their optimal...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computer journal 2003, Vol.46 (6), p.632-644
Hauptverfasser:	Heun, Volker, Mayr, Ernst W
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Communication Computers Embedded systems Graphs Hypercubes Multiprocessors Topology
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!