Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees

DOI10.1016/J.ENDM.2016.05.032zbMath1347.05231OpenAlexW2513732364MaRDI QIDQ327683

Jessie Abraham, Micheal Arockiaraj

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.032

zbMATH Keywords

embeddingcomplete binary treeenhanced hypercubewirelength

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (1)

On some similarity of finite sets (and what we can say today about certain old problem)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Exact wirelength of hypercubes on a grid
• Embedding ladders and caterpillars into the hypercube
• An edge-isoperimetric problem for powers of the Petersen graph
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Wirelength of hypercubes into certain trees
• 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
• Linear layout of directed grid graph
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Embedding of cycles and wheels into arbitrary trees

This page was built for publication: Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees