Optimal layout of embedding onto folded hypercubes

DOI10.1142/S0129054125500066MaRDI QIDQ6881002zbMATH OpenFDO

Authors Rini Dominic D., R. Sundara Rajan, T. M. Rajalaxmi, L. Packiaraj

Publication date 18 December 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054125500066

zbMATH Keywords

\(k\)-rooted complete binary tree\(k\)-rooted sibling treebinomial treecongestioncycle-of-laddersembeddingfolded hypercubeVLSI layoutwirelengthwounded lobster

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
• Embedding augmented cube into certain trees and windmill graphs
• Embedding complete trees into the hypercube
• Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelength
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Embedding of hypercubes into necklace, windmill and snake graphs
• Embedding of meshes in Möbius cubes
• Embedding Wheel - like Networks
• Exact wirelength of hypercubes on a grid
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• Implementation and Analysis of Binomial Queue Algorithms
• Linear wirelength of folded hypercubes
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Minimum Linear Arrangement of Generalized Sierpinski Graphs
• Path embedding in star graphs
• Scheduling 2-dimensional grids with large communication delays
• The bipancycle-connectivity of the hypercube
• Two new classes of trees embeddable into hypercubes
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Wirelength of embedding complete multipartite graphs into certain graphs
• Wirelength of hypercubes into certain trees

Cited in

(3)

• Maximum subgraph and wirelength analysis of extended Sierpiński networks in parallel computing
• Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures
• An upper bound for edge congestion and the exact wirelength of embedding onto BC graphs

This page was built for publication: Optimal layout of embedding onto folded hypercubes

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