Optimal tree contraction and term matching on the hypercube and related networks

Abstract: "An optimal tree contraction algorithm for the boolean hypercube and the constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on novel routing techniques and, for certain small subtrees, simulates optimal PRAM...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Mayr, Ernst W. 1950- (VerfasserIn), Werchner, Ralph (VerfasserIn)
Format:	Buch
Sprache:	German
Veröffentlicht:	München 1995
Schriftenreihe:	Technische Universität <München>: TUM-I 9532
Schlagworte:	Hypercube networks (Computer networks) Logic programming Rewriting systems (Computer science) Trees (Graph theory)
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!