Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs

Dun Wei Cheng, Kai Hsun Yao, Sun Yuan Hsieh

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Article number9431213
Pages (from-to)74028-74037
Number of pages10
JournalIEEE Access
Volume9
DOIs
Publication statusPublished - 2021

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Fingerprint

Dive into the research topics of 'Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs'. Together they form a unique fingerprint.

Cite this