Pages that link to "Item:Q1273899"
From MaRDI portal
The following pages link to Embedding of \(k\)-ary complete trees into hypercubes with uniform load (Q1273899):
Displaying 10 items.
- Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes (Q396672) (← links)
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Load balanced tree embeddings (Q1199090) (← links)
- Efficient embeddings of ternary trees into hypercubes. (Q1398807) (← links)
- Embedding complete \(k\)-ary trees into \(k\)-square 2-D meshes with optimal edge congestion (Q1575316) (← links)
- Embedding large complete binary trees in hypercubes with load balancing (Q1923393) (← links)
- On the<i>k</i>-ary hypercube tree and its average distance (Q3101622) (← links)
- (Q4250720) (← links)
- A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES (Q5249037) (← links)
- Optimal dynamic embeddings of complete binary trees into hypercubes (Q5949497) (← links)
