Optimal dynamic embeddings of complete binary trees into hypercubes
From MaRDI portal
Publication:5949497
DOI10.1006/jpdc.2001.1734zbMath0988.68077OpenAlexW1988349271MaRDI QIDQ5949497
Publication date: 22 July 2002
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.2001.1734
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees ⋮ Wirelength of hypercubes into certain trees
This page was built for publication: Optimal dynamic embeddings of complete binary trees into hypercubes