Wirelength of enhanced hypercubes into r-rooted complete binary trees

DOI10.1016/J.ENDM.2016.05.032MaRDI QIDQ327683zbMATH OpenOpenAlexFDO

Authors 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) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65) Parallel algorithms in computer science (68W10)

Recommendations

• Wirelength of hypercubes into certain trees
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Embeddings Between Hypercubes and Hypertrees
• Exact wirelength of hypercube layout on \(k\)-cube necklace
• Exact wirelength of hypercube and enhanced hypercube layout on regular caterpillars

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• An edge-isoperimetric problem for powers of the Petersen graph
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Embedding ladders and caterpillars into the hypercube
• Embedding of cycles and wheels into arbitrary trees
• Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
• Exact wirelength of hypercubes on a grid
• Introduction to algorithms
• Linear layout of directed grid graph
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• The congestion of \(n\)-cube layout on a rectangular grid
• Wirelength of hypercubes into certain trees

Cited in

(4)

• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Wirelength of hypercubes into certain trees
• On some similarity of finite sets (and what we can say today about certain old problem)
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327683)