Pages that link to "Item:Q3150271"
From MaRDI portal
The following pages link to Efficient Dynamic Embeddings of Binary Trees into Hypercubes (Q3150271):
Displaying 7 items.
- Compact embedding of binary trees into hypercubes (Q673463) (← links)
- Optimal dynamic embedding of X-trees into arrays (Q1105377) (← links)
- Lower bounds for dynamic tree embedding in bipartite networks (Q1273880) (← links)
- The minimum spectral radius of an edge-removed network: a hypercube perspective (Q2398757) (← 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)
- Optimal dynamic embeddings of complete binary trees into hypercubes (Q5949497) (← links)