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)

zbMATH Keywords

embeddingcongestionVLSI layoutwirelengthbinomial treefolded hypercubecycle-of-ladders\(k\)-rooted complete binary tree\(k\)-rooted sibling treewounded lobster

Mathematics Subject Classification ID

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

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)