Header menu link for other important links
X
Embedding of circulant networks into k-rooted sibling trees
R. Sundara Rajan, , T.M. Rajalaxmi, N. Parthiban
Published in
2013
Volume: 86
   
Issue: 6
Pages: 1005 - 1012
Abstract
Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength and dilation of embedding circulant networks into k-rooted sibling trees. © 2013 Academic Publications, Ltd.
About the journal
JournalInternational Journal of Pure and Applied Mathematics
ISSN13118080