English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Interconnection networks provide an effective mechanism for exchanging databetween processors in a parallel computing system. One of the most efficientinterconnection networks is the hypercube due to its structural regularity,potential for parallel computation of various algorithms, and the high degreeof fault tolerance. Thus it becomes the first choice of topological structureof parallel processing and computing systems. In this paper, lower bounds forthe dilation, wirelength, and edge congestion of an embedding of a graph into ahypercube are proved. Two of these bounds are expressed in terms of thebisection width. Applying these results, the dilation and wirelength ofembedding of certain complete multipartite graphs, folded hypercubes, wheels,and specific Cartesian products are computed.

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes