Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelength
From MaRDI portal
Publication:6492014
Cites work
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- An algorithm to construct independent spanning trees on parity cubes
- An edge-isoperimetric problem for powers of the Petersen graph
- Communication Performance Evaluation of the Locally Twisted Cube
- Cycles embedding in exchanged crossed cube
- Embedding algorithm of spined cube into grid structure and its wirelength computation
- Embedding complete multipartite graphs into certain trees
- Embedding of hypercubes into sibling trees
- Exact wirelength of hypercubes on a grid
- Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
- Linear wirelength of folded hypercubes
- Node set optimization problem for complete Josephus cubes
- On \(g\)-extra conditional diagnosability of hierarchical cubic networks
- On conditional fault tolerance and diagnosability of hierarchical cubic networks
- On conditional fault tolerance of hierarchical cubic networks
- On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
- Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
- The Josephus cube: A novel interconnection network
- The generalized 4-connectivity of hierarchical cubic networks
- The locally twisted cubes
- The spined cube: a new hypercube variant with smaller diameter
- Wirelength of hypercubes into certain trees
This page was built for publication: Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492014)
