Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength

DOI10.1016/j.jcss.2024.103603MaRDI QIDQ6655675

Zhiyi Tang

Publication date: 27 December 2024

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

hypercubetorusCartesian productembedding wirelengthGray code embedding

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
• Exact wirelength of hypercubes on a grid
• Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
• A linear time algorithm for embedding hypercube into cylinder and torus
• Characterization of the congestion lemma on layout computation
• Edge isoperimetric inequalities for powers of the hypercube
• On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
• Conjectures on wirelength of hypercube into cylinder and torus
• Embedding meshes into crossed cubes
• Optimal embedding of hypercube into cylinder
• A rigorous proof on circular wirelength for hypercubes
• On embedding rectangular grids in hypercubes
• Maximally Connected Arrays on the n-Cube
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength