Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
From MaRDI portal
Publication:6492014
DOI10.1142/S0129054123500053MaRDI QIDQ6492014
Weibei Fan, Jianxi Fan, Ruyan Guo, Yan Wang
Publication date: 24 April 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Computer system organization (68Mxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Linear wirelength of folded hypercubes
- On conditional fault tolerance and diagnosability of hierarchical cubic networks
- Exact wirelength of hypercubes on a grid
- An edge-isoperimetric problem for powers of the Petersen graph
- On conditional fault tolerance of hierarchical cubic networks
- Wirelength of hypercubes into certain trees
- An algorithm to construct independent spanning trees on parity cubes
- The spined cube: a new hypercube variant with smaller diameter
- The Josephus cube: A novel interconnection network
- Embedding algorithm of spined cube into grid structure and its wirelength computation
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
- The generalized 4-connectivity of hierarchical cubic networks
- On \(g\)-extra conditional diagnosability of hierarchical cubic networks
- Node set optimization problem for complete Josephus cubes
- Embedding of hypercubes into sibling trees
- Cycles Embedding in Exchanged Crossed Cube
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- The locally twisted cubes
- Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees
- Embedding Complete Multipartite Graphs into Certain Trees
- Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model
- Communication Performance Evaluation of the Locally Twisted Cube
This page was built for publication: Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
