Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs
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 sho...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9431213/ |
| _version_ | 1811210357898739712 |
|---|---|
| author | Dun-Wei Cheng Kai-Hsun Yao Sun-Yuan Hsieh |
| author_facet | Dun-Wei Cheng Kai-Hsun Yao Sun-Yuan Hsieh |
| author_sort | Dun-Wei Cheng |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-12T04:53:02Z |
| format | Article |
| id | doaj.art-edaed21fe4ff43cc96acec291b0599f9 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-12T04:53:02Z |
| publishDate | 2021-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-edaed21fe4ff43cc96acec291b0599f92022-12-22T03:47:14ZengIEEEIEEE Access2169-35362021-01-019740287403710.1109/ACCESS.2021.30803159431213Constructing Independent Spanning Trees on Generalized Recursive Circulant GraphsDun-Wei Cheng0https://orcid.org/0000-0001-9095-1288Kai-Hsun Yao1Sun-Yuan Hsieh2https://orcid.org/0000-0003-4746-3179Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, TaiwanDepartment of Computer Science and Information Engineering, National Cheng Kung University, Tainan, TaiwanDepartment of Computer Science and Information Engineering, Institute of Medical Informatics and Center for Innovative FinTech Business Models, National Cheng Kung University, Tainan, TaiwanThe 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.https://ieeexplore.ieee.org/document/9431213/Independent spanning treesgeneralized recursive circulant graphsinterconnection networks |
| spellingShingle | Dun-Wei Cheng Kai-Hsun Yao Sun-Yuan Hsieh Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs IEEE Access Independent spanning trees generalized recursive circulant graphs interconnection networks |
| title | Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs |
| title_full | Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs |
| title_fullStr | Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs |
| title_full_unstemmed | Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs |
| title_short | Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs |
| title_sort | constructing independent spanning trees on generalized recursive circulant graphs |
| topic | Independent spanning trees generalized recursive circulant graphs interconnection networks |
| url | https://ieeexplore.ieee.org/document/9431213/ |
| work_keys_str_mv | AT dunweicheng constructingindependentspanningtreesongeneralizedrecursivecirculantgraphs AT kaihsunyao constructingindependentspanningtreesongeneralizedrecursivecirculantgraphs AT sunyuanhsieh constructingindependentspanningtreesongeneralizedrecursivecirculantgraphs |