The following pages link to (Q4369764):
Displaying 6 items.
- Embedding meshes of trees into deBruijn graphs (Q1199946) (← links)
- Embedding complete \(k\)-ary trees into \(k\)-square 2-D meshes with optimal edge congestion (Q1575316) (← links)
- Dense edge-disjoint embedding of complete binary trees in interconnection networks (Q1583538) (← links)
- On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks (Q1810462) (← links)
- Optimal two-sided embeddings of complete binary trees in rectangular grids (Q2332034) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
