首页    期刊浏览 2024年11月28日 星期四
登录注册

文章基本信息

  • 标题:Embeddings Between Circulant Networks and Hypertrees
  • 本地全文:下载
  • 作者:A. Arul Shantrinal ; R. Sundara Rajan ; T.M. Rajalaxmi
  • 期刊名称:Lecture Notes in Engineering and Computer Science
  • 印刷版ISSN:2078-0958
  • 电子版ISSN:2078-0966
  • 出版年度:2018
  • 卷号:2231&2232
  • 页码:85-89
  • 出版社:Newswood and International Association of Engineers
  • 摘要:Graph embedding has been known as a powerful tool for implementation of parallel algorithms and simulation of different interconnection networks. In this paper, we compute the exact wirelength of embedding circulants network into hypertrees and vice-versa.
  • 关键词:Embedding; congestion; wirelength; circulant network; chord graph; hypertree
国家哲学社会科学文献中心版权所有