Optimal embedding of complete binary trees into lines and grids
From MaRDI portal
Recommendations
- Optimal embedding of complete binary trees into lines and grids
- Optimal two-sided embeddings of complete binary trees in rectangular grids
- On the complexity of tree embedding problems
- Optimal dynamic embeddings of complete binary trees into hypercubes
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
Cited in
(19)- Embeddings of binary trees in lines
- Optimal embedding of complete binary trees into lines and grids
- On the complexity of tree embedding problems
- Two results on linear embeddings of complete binary trees
- Embedding complete binary trees into star and Pancake graphs
- Expansion of layouts of complete binary trees into grids
- On optimal embeddings and trees
- An optimal emulator and VLSI layout for complete binary trees
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- Optimal two-sided embeddings of complete binary trees in rectangular grids
- On some optimal embeddings of binary and ternary trees in planar rectangular lattices
- Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
- Towards optimal embedding of an arbitrary tree in a graceful tree
- scientific article; zbMATH DE number 3945345 (Why is no real title available?)
- scientific article; zbMATH DE number 125491 (Why is no real title available?)
- Optimal distortion embedding of complete binary trees into lines
- Embedding complete binary trees into star networks
- How to fit a tree in a box
- Embedding complete binary trees in product graphs
This page was built for publication: Optimal embedding of complete binary trees into lines and grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694714)