Pages that link to "Item:Q1209372"
From MaRDI portal
The following pages link to On the complexity of tree embedding problems (Q1209372):
Displaying 14 items.
- Towards optimal embedding of an arbitrary tree in a graceful tree (Q324915) (← links)
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Optimal one-page tree embeddings in linear time (Q1014395) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Optimal embedding of complete binary trees into lines and grids (Q1130317) (← links)
- On optimal embeddings and trees (Q1668843) (← links)
- Minimum layout of circulant graphs into certain height balanced trees (Q1683534) (← links)
- An optimal emulator and VLSI layout for complete binary trees (Q1920223) (← links)
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes (Q3150270) (← links)
- (Q3334090) (← links)
- (Q4027193) (← links)
- Congestion-free, dilation-2 embedding of complete binary trees into star graphs (Q4254358) (← links)
- The Parallel Complexity of Tree Embedding Problems (Q4327818) (← links)
- The parallel complexity of tree embedding problems (extended abstract) (Q5096766) (← links)