Wirelength of hypercubes into certain trees

DOI10.1016/J.DAM.2011.12.007zbMath1253.68265OpenAlexW1998160688MaRDI QIDQ1759856

Xianqiang Yang

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.007

zbMATH Keywords

embeddinghypercubescongestionwirelengthedge isoperimetric problem

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (13)

Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees ⋮ Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength ⋮ On linear layout of bicube and construction of optimal incomplete bicube ⋮ Maximum subgraph problem for 3-regular Knödel graphs and its wirelength ⋮ Embedding Wheel - like Networks ⋮ On some similarity of finite sets (and what we can say today about certain old problem) ⋮ On the optimal layout of balanced complete multipartite graphs into grids and tree related structures ⋮ Embedding of hypercubes into sibling trees ⋮ Wiener Index of Hypertree ⋮ Improved Bound for Dilation of an Embedding onto Circulant Networks ⋮ Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees ⋮ Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength ⋮ Maximum incomplete recursive circulants in graph embeddings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dense sets and embedding binary trees into hypercubes
• On embedding subclasses of height-balanced trees in hypercubes
• Exact wirelength of hypercubes on a grid
• The cyclic cutwidth of trees
• Embedding of binomial trees in hypercubes with link faults
• Embedding ladders and caterpillars into the hypercube
• An edge-isoperimetric problem for powers of the Petersen graph
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• 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
• Efficient Embeddings of Trees in Hypercubes
• 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
• Optimal embeddings of generalized ladders into hypercubes
• Embedding complete trees into the hypercube
• Optimal dynamic embeddings of complete binary trees into hypercubes

This page was built for publication: Wirelength of hypercubes into certain trees