Embedding all binary trees in the hypercube
From MaRDI portal
Publication:1309233
DOI10.1006/jpdc.1993.1042zbMath0800.68150OpenAlexW2075620130MaRDI QIDQ1309233
Publication date: 9 January 1994
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1993.1042
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07)
Related Items (6)
Large fault-tolerant interconnection networks ⋮ Embedding ladders and caterpillars into the hypercube ⋮ On some similarity of finite sets (and what we can say today about certain old problem) ⋮ Embedding complete binary trees into hypercubes ⋮ Unnamed Item ⋮ On the complexity of the embedding problem for hypercube related graphs
This page was built for publication: Embedding all binary trees in the hypercube
