Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelength

DOI10.1142/S0129054123500053MaRDI QIDQ6492014FDOQ6492014

Authors: Ruyan Guo, Yan Wang, Jianxi Fan, Weibei Fan 

Publication date: 24 April 2024

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph embeddingwirelengthhierarchical cubic networks\(k\)-rooted complete binary trees

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Graph theory (05Cxx) Computer system organization (68Mxx)

Cites Work

• The locally twisted cubes
• 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
• Wirelength of hypercubes into certain trees
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• An algorithm to construct independent spanning trees on parity cubes
• Communication Performance Evaluation of the Locally Twisted Cube
• The spined cube: a new hypercube variant with smaller diameter
• Linear wirelength of folded hypercubes
• Embedding Complete Multipartite Graphs into Certain Trees
• On \(g\)-extra conditional diagnosability of hierarchical cubic networks
• Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model
• The generalized 4-connectivity of hierarchical cubic networks
• Cycles Embedding in Exchanged Crossed Cube
• On conditional fault tolerance of hierarchical cubic networks
• The Josephus cube: A novel interconnection network
• Embedding of hypercubes into sibling trees
• Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees
• 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
• Node set optimization problem for complete Josephus cubes

Cited In (1)

• Embedding of hypercube into fractal cubic network

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)