Answers are grounded in this paper and cite their sources.
An network that is closely interconnected by smaller units, forms the structural core in systems of parallel computing, integrating units like processors and their communication links for effective data exchange. Its performance is primarily governed by parameters such as wirelength, dilation, bandwidth and minimum cutwidth. The arrangement of these configurations in an optimal setup remains a key challenge, where the study of graph embedding offers an effective framework for enhancing parallel algorithm performance and overall system efficiency. This study employes an embedding function, which maps the guest graph, the family of (Kp−Cp)n onto suitable host structures.
No takes yet. Share an insight, caveat, or question.
Vincy et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: