Constructing Independent Spanning Trees on Transposition Networks

Chien Fu Lin, Jie Fu Huang, Sun Yuan Hsieh

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


In interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks. Transposition networks are a type of Cayley graphs and have been widely used in current networks. Whenever any connection node fails, users want to reconnect as rapidly as possible, it is urgently in need to construct a new path. Thus, searching node-disjoint paths is crucial for finding a new path in networks. In this article, we expand the target to construct independent spanning trees to maximize the fault tolerance of transposition networks.

Original languageEnglish
Article number9160957
Pages (from-to)147122-147132
Number of pages11
JournalIEEE Access
Publication statusPublished - 2020

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'Constructing Independent Spanning Trees on Transposition Networks'. Together they form a unique fingerprint.

Cite this