Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
From MaRDI portal
Publication:628321
DOI10.1016/j.dam.2010.12.001zbMath1209.05050MaRDI QIDQ628321
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.001
embedding; complete binary tree; enhanced hypercube; folded hypercube; augmented hypercube; average edge congestion; fixed interconnection parallel architecture
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees, Embedding of hypercubes into necklace, windmill and snake graphs, Bothway embedding of circulant network into grid, Reliability measure of multiprocessor system based on enhanced hypercubes, Node set optimization problem for complete Josephus cubes, The extra connectivity of the enhanced hypercubes, Embedding of hypercubes into sibling trees, Embedding of recursive circulants into certain necklace graphs, Maximum incomplete recursive circulants in graph embeddings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On embedding graphs in trees
- On the complexity of tree embedding problems
- The cyclic cutwidth of trees
- Two results on linear embeddings of complete binary trees
- Embedding complete binary trees into star and Pancake graphs
- Embedding ladders and caterpillars into the hypercube
- On embedding complete graphs into hypercubes
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- The congestion of \(n\)-cube layout on a rectangular grid
- Complete binary trees in folded and enhanced cubes
- Embedding of cycles and wheels into arbitrary trees
- Augmented cubes
- Optimal embeddings of generalized ladders into hypercubes
- Uniform emulations of Cartesian-product and Cayley graphs
