Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

DOI10.1016/j.dam.2010.12.001zbMath1209.05050OpenAlexW2023955326MaRDI QIDQ628321

Paul D. Manuel

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

zbMATH Keywords

embeddingcomplete binary treeenhanced hypercubefolded hypercubeaugmented hypercubeaverage edge congestionfixed interconnection parallel architecture

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees ⋮ Optimal embedding of hypercube into cylinder ⋮ On some similarity of finite sets (and what we can say today about certain old problem) ⋮ Embedding of hypercubes into necklace, windmill and snake graphs ⋮ Reliability measure of multiprocessor system based on enhanced hypercubes ⋮ Embedding of hypercubes into sibling trees ⋮ Bothway embedding of circulant network into grid ⋮ Maximum incomplete recursive circulants in graph embeddings ⋮ Node set optimization problem for complete Josephus cubes ⋮ Embedding of recursive circulants into certain necklace graphs ⋮ The extra connectivity of the enhanced hypercubes ⋮ Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes

Cites Work

• 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
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• 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

This page was built for publication: Minimum average congestion of enhanced and augmented hypercubes into complete binary trees