Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs

Dun Wei Cheng, Kai Hsun Yao, Sun Yuan Hsieh

研究成果: Article同行評審

摘要

The generalized recursive circulant networking can be widely used in the design and implementation of interconnection networks. It consists of a series of processors, each is connected through bidirectional, point-to-point communication channels to different neighbors. In this work, we apply the shortest path routing concept to build independent spanning trees on the generalized recursive circulant graphs. The proposed strategy loosen the restricted conditions in previous research and extended the result to a more general vertex setting by design the specific algorithm to deal with the constraint issue.

原文English
文章編號9431213
頁(從 - 到)74028-74037
頁數10
期刊IEEE Access
9
DOIs
出版狀態Published - 2021

All Science Journal Classification (ASJC) codes

  • 電腦科學(全部)
  • 材料科學(全部)
  • 工程 (全部)

指紋

深入研究「Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs」主題。共同形成了獨特的指紋。

引用此