Wirelength of enhanced hypercubes into r-rooted complete binary trees

DOI10.1016/J.ENDM.2016.05.032zbMATH Open1347.05231OpenAlexW2513732364MaRDI QIDQ327683FDOQ327683

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

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

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)

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

Cited In (4)

• 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
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Wirelength of hypercubes into certain 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)