Pages that link to "Item:Q3990107"
From MaRDI portal
The following pages link to Efficient Embeddings of Trees in Hypercubes (Q3990107):
Displaying 32 items.
- Towards optimal embedding of an arbitrary tree in a graceful tree (Q324915) (← links)
- Embedding a subclass of trees into hypercubes (Q534055) (← links)
- Compact embedding of binary trees into hypercubes (Q673463) (← links)
- Embedding multidimensional grids into optimal hypercubes (Q740976) (← links)
- Embeddings on a Boolean cube (Q911244) (← links)
- Hypercube embedding heuristics: An evaluation (Q916339) (← links)
- Optimal one-page tree embeddings in linear time (Q1014395) (← links)
- Optimal dynamic embedding of X-trees into arrays (Q1105377) (← links)
- Product-shuffle networks: Toward reconciling shuffles and butterflies (Q1199448) (← links)
- A probably optimal embedding of hyper-rings in hypercubes (Q1350610) (← links)
- Embedding ladders and caterpillars into the hypercube (Q1392524) (← links)
- Efficient embeddings of ternary trees into hypercubes. (Q1398807) (← links)
- Recursive circulants and their embeddings among hypercubes (Q1575703) (← links)
- On optimal embeddings and trees (Q1668843) (← links)
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees (Q1751113) (← links)
- Wirelength of hypercubes into certain trees (Q1759856) (← links)
- A new combinatorial approach to optimal embeddings of rectangles (Q1920427) (← links)
- Embedding trees in recursive circulants (Q1923603) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes (Q3150270) (← links)
- Embeddings Between Hypercubes and Hypertrees (Q3196315) (← links)
- (Q3334090) (← links)
- Embedding meshes in hypercubes with edge faults (Q4208595) (← links)
- An approach to emulating separable graphs (Q4277376) (← links)
- Compressing grids into small hypercubes (Q4313625) (← links)
- Small congestion embedding of graphs into hypercubes (Q4540091) (← links)
- A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube (Q4876698) (← links)
- Efficient Schemes for Computing α-tree Representations (Q4925100) (← links)
- (Q5121937) (← links)
- A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES (Q5249037) (← links)
- On some similarity of finite sets (and what we can say today about certain old problem) (Q6199497) (← links)
- Embeddings of hyper-rings in hypercubes (Q6487978) (← links)
