Pages that link to "Item:Q1398807"
From MaRDI portal
The following pages link to Efficient embeddings of ternary trees into hypercubes. (Q1398807):
Displaying 16 items.
- Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes (Q396672) (← links)
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- Bothway embedding of circulant network into grid (Q491606) (← links)
- Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements (Q629361) (← links)
- Compact embedding of binary trees into hypercubes (Q673463) (← links)
- Embedding of \(k\)-ary complete trees into hypercubes with uniform load (Q1273899) (← links)
- Embedding the complete tree in the hypercube (Q1325976) (← links)
- Embedding of the folded hypercubes into tori (Q2516503) (← links)
- Embedding Circulant Networks into Butterfly and Benes Networks (Q2946066) (← links)
- Embedding complete ternary trees into hypercubes (Q3633839) (← links)
- Efficient Embeddings of Trees in Hypercubes (Q3990107) (← links)
- Embedding hyperpyramids into hypercubes (Q4313616) (← links)
- Embedding binary trees into crossed cubes (Q4421228) (← 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)
- Embedding complete trees into the hypercube (Q5936455) (← links)
