Embedding the complete tree in the hypercube

DOI10.1006/jpdc.1994.1023zbMath0805.68026OpenAlexW1970352651MaRDI QIDQ1325976

A. S. Wagner

Publication date: 26 January 1995

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1994.1023

zbMATH Keywords

spanning treemultiprocessorscomplete binary treedivide-and-conquer algorithmsBoolean hypercubetree-structured computation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (1)

Compact embedding of binary trees into hypercubes

This page was built for publication: Embedding the complete tree in the hypercube