Pages that link to "Item:Q4876698"
From MaRDI portal
The following pages link to A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube (Q4876698):
Displaying 6 items.
- Dense sets and embedding binary trees into hypercubes (Q869570) (← links)
- Embedding large complete binary trees in hypercubes with load balancing (Q1923393) (← links)
- Efficient Dynamic Embeddings of Binary Trees into Hypercubes (Q3150271) (← links)
- Fibonacci hypercube (Q3838256) (← links)
- A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES (Q5249037) (← links)
- On some similarity of finite sets (and what we can say today about certain old problem) (Q6199497) (← links)