Header menu link for other important links
Embedding Circulant Networks into Butterfly and Benes Networks
, , , Rajalaxmi T.M, Parthiba N.
Published in Springer International Publishing
Volume: 8986
Pages: 298 - 306
The dilation of an embedding is defined as the maximum distance between pairs of vertices of host graph that are images of adjacent vertices of guest graph. An embedding with a long dilation faces many problems, such as long communication delay, coupling problems and the existence of different types of uncontrolled noise. In this paper, we compute the minimum dilation of embedding circulant networks into butterfly and benes networks. © Springer International Publishing Switzerland 2015.
About the journal
JournalData powered by TypesetLecture Notes in Computer Science Combinatorial Algorithms
PublisherData powered by TypesetSpringer International Publishing
Open Access0