Embedding complete binary trees into star networks
From MaRDI portal
Recommendations
Cites work
- Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group
- Embedding complete binary trees into star and Pancake graphs
- scientific article; zbMATH DE number 4147467 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
Cited in
(13)- Path embedding in star graphs
- Simulation of binary trees and X-trees on pyramid networks
- Embedding meshes on the star graph
- Embeddings of star graphs into optical meshes without bends
- Embedding complete binary trees into star and Pancake graphs
- Dense edge-disjoint embedding of complete binary trees in interconnection networks
- On embeddings in cycles
- Improved bound for dilation of an embedding onto circulant networks
- Congestion-free, dilation-2 embedding of complete binary trees into star graphs
- scientific article; zbMATH DE number 1953271 (Why is no real title available?)
- Embedding star networks into hypercubes
- Embedding an arbitrary binary tree into the star graph
- One-to-many embeddings of hypercubes into Cayley graphs generated by reversals
This page was built for publication: Embedding complete binary trees into star networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096884)