Pages that link to "Item:Q673463"
From MaRDI portal
The following pages link to Compact embedding of binary trees into hypercubes (Q673463):
Displaying 14 items.
- Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes (Q396672) (← links)
- Embedding a subclass of trees into hypercubes (Q534055) (← links)
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Binary space partitioning trees as an alternative representation of polytopes (Q805288) (← links)
- Dense sets and embedding binary trees into hypercubes (Q869570) (← links)
- Embedding complete binary trees into hypercubes (Q1178228) (← links)
- Embedding the complete tree in the hypercube (Q1325976) (← links)
- Incomplete hypercubes: Embeddings of tree-related networks (Q1892859) (← links)
- On certain trees in hypercubes (Q3972004) (← links)
- Embedding binary trees into crossed cubes (Q4421228) (← 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 note on the cubical dimension of new classes of binary trees (Q5249653) (← links)
- Two new classes of trees embeddable into hypercubes (Q5693009) (← links)