Dense edge-disjoint embedding of complete binary trees in the hypercube
From MaRDI portal
Recommendations
Cited in
(15)- Embedding complete binary trees into hypercubes
- On constructing multiple spanning trees in a hypercube
- Embedding the complete tree in the hypercube
- Dense edge-disjoint embedding of complete binary trees in interconnection networks
- Incomplete hypercubes: Embeddings of tree-related networks
- Embedding large complete binary trees in hypercubes with load balancing
- scientific article; zbMATH DE number 4064517 (Why is no real title available?)
- Efficient Embeddings of Trees in Hypercubes
- On Oriented Embedding of the Binary Tree into the Hypercube
- scientific article; zbMATH DE number 1103048 (Why is no real title available?)
- scientific article; zbMATH DE number 1472115 (Why is no real title available?)
- Salvage-Embeddings of Complete Trees
- On embedding of certain recursive trees and stars into hypercube
- Optimal dynamic embeddings of complete binary trees into hypercubes
- Dense sets and embedding binary trees into hypercubes
This page was built for publication: Dense edge-disjoint embedding of complete binary trees in the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365823)