Optimal embedding of hypercube into cylinder
From MaRDI portal
Publication:2672634
DOI10.1016/j.tcs.2022.05.020OpenAlexW4281554359MaRDI QIDQ2672634
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.04287
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
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
- Exact wirelength of hypercubes on a grid
- A linear time algorithm for embedding hypercube into cylinder and torus
- Characterization of the congestion lemma on layout computation
- 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 of hypercubes into sibling trees
- A rigorous proof on circular wirelength for hypercubes
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Optimal Assignments of Numbers to Vertices
- Algorithms and Computation
