Pages that link to "Item:Q5949497"
From MaRDI portal
The following pages link to Optimal dynamic embeddings of complete binary trees into hypercubes (Q5949497):
Displaying 12 items.
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Compact embedding of binary trees into hypercubes (Q673463) (← links)
- Complete binary trees embeddings in Möbius cubes (Q896018) (← links)
- Optimal dynamic embedding of X-trees into arrays (Q1105377) (← links)
- Optimal embedding of complete binary trees into lines and grids (Q1130317) (← links)
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees (Q1751113) (← links)
- Wirelength of hypercubes into certain trees (Q1759856) (← links)
- Embedding large complete binary trees in hypercubes with load balancing (Q1923393) (← links)
- Efficient Dynamic Embeddings of Binary Trees into Hypercubes (Q3150271) (← links)
- Complete binary trees in folded and enhanced cubes (Q4474302) (← links)
- A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube (Q4876698) (← links)
- A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES (Q5249037) (← links)