Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs Article Swipe
Dun-Wei Cheng
,
Kai-Hsun Yao
,
Sun‐Yuan Hsieh
·
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1109/access.2021.3080315
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1109/access.2021.3080315
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.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1109/access.2021.3080315
- https://ieeexplore.ieee.org/ielx7/6287639/9312710/09431213.pdf
- OA Status
- gold
- Cited By
- 8
- References
- 23
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W3163478546
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3163478546Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1109/access.2021.3080315Digital Object Identifier
- Title
-
Constructing Independent Spanning Trees on Generalized Recursive Circulant GraphsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-01-01Full publication date if available
- Authors
-
Dun-Wei Cheng, Kai-Hsun Yao, Sun‐Yuan HsiehList of authors in order
- Landing page
-
https://doi.org/10.1109/access.2021.3080315Publisher landing page
- PDF URL
-
https://ieeexplore.ieee.org/ielx7/6287639/9312710/09431213.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://ieeexplore.ieee.org/ielx7/6287639/9312710/09431213.pdfDirect OA link when available
- Concepts
-
Circulant matrix, Spanning tree, Computer science, Combinatorics, Mathematics, Discrete mathematics, Theoretical computer scienceTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
8Total citation count in OpenAlex
- Citations by year (recent)
-
2023: 5, 2022: 2, 2021: 1Per-year citation counts (last 5 years)
- References (count)
-
23Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3163478546 |
|---|---|
| doi | https://doi.org/10.1109/access.2021.3080315 |
| ids.doi | https://doi.org/10.1109/access.2021.3080315 |
| ids.mag | 3163478546 |
| ids.openalex | https://openalex.org/W3163478546 |
| fwci | 1.28073696 |
| type | article |
| title | Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs |
| biblio.issue | |
| biblio.volume | 9 |
| biblio.last_page | 74037 |
| biblio.first_page | 74028 |
| topics[0].id | https://openalex.org/T10374 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998000264167786 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1703 |
| topics[0].subfield.display_name | Computational Theory and Mathematics |
| topics[0].display_name | Advanced Graph Theory Research |
| topics[1].id | https://openalex.org/T10829 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9984999895095825 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Interconnection Networks and Systems |
| topics[2].id | https://openalex.org/T10720 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.991100013256073 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1703 |
| topics[2].subfield.display_name | Computational Theory and Mathematics |
| topics[2].display_name | Complexity and Algorithms in Graphs |
| funders[0].id | https://openalex.org/F4320324663 |
| funders[0].ror | https://ror.org/01b8kcc49 |
| funders[0].display_name | National Cheng Kung University |
| is_xpac | False |
| apc_list.value | 1850 |
| apc_list.currency | USD |
| apc_list.value_usd | 1850 |
| apc_paid.value | 1850 |
| apc_paid.currency | USD |
| apc_paid.value_usd | 1850 |
| concepts[0].id | https://openalex.org/C115973184 |
| concepts[0].level | 2 |
| concepts[0].score | 0.702244758605957 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q245457 |
| concepts[0].display_name | Circulant matrix |
| concepts[1].id | https://openalex.org/C64331007 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6539934277534485 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q831672 |
| concepts[1].display_name | Spanning tree |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.5442022681236267 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C114614502 |
| concepts[3].level | 1 |
| concepts[3].score | 0.44937023520469666 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[3].display_name | Combinatorics |
| concepts[4].id | https://openalex.org/C33923547 |
| concepts[4].level | 0 |
| concepts[4].score | 0.3998104929924011 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[4].display_name | Mathematics |
| concepts[5].id | https://openalex.org/C118615104 |
| concepts[5].level | 1 |
| concepts[5].score | 0.37114399671554565 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q121416 |
| concepts[5].display_name | Discrete mathematics |
| concepts[6].id | https://openalex.org/C80444323 |
| concepts[6].level | 1 |
| concepts[6].score | 0.32124558091163635 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[6].display_name | Theoretical computer science |
| keywords[0].id | https://openalex.org/keywords/circulant-matrix |
| keywords[0].score | 0.702244758605957 |
| keywords[0].display_name | Circulant matrix |
| keywords[1].id | https://openalex.org/keywords/spanning-tree |
| keywords[1].score | 0.6539934277534485 |
| keywords[1].display_name | Spanning tree |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.5442022681236267 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/combinatorics |
| keywords[3].score | 0.44937023520469666 |
| keywords[3].display_name | Combinatorics |
| keywords[4].id | https://openalex.org/keywords/mathematics |
| keywords[4].score | 0.3998104929924011 |
| keywords[4].display_name | Mathematics |
| keywords[5].id | https://openalex.org/keywords/discrete-mathematics |
| keywords[5].score | 0.37114399671554565 |
| keywords[5].display_name | Discrete mathematics |
| keywords[6].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[6].score | 0.32124558091163635 |
| keywords[6].display_name | Theoretical computer science |
| language | en |
| locations[0].id | doi:10.1109/access.2021.3080315 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S2485537415 |
| locations[0].source.issn | 2169-3536 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2169-3536 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | IEEE Access |
| locations[0].source.host_organization | https://openalex.org/P4310319808 |
| locations[0].source.host_organization_name | Institute of Electrical and Electronics Engineers |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319808 |
| locations[0].source.host_organization_lineage_names | Institute of Electrical and Electronics Engineers |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://ieeexplore.ieee.org/ielx7/6287639/9312710/09431213.pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | IEEE Access |
| locations[0].landing_page_url | https://doi.org/10.1109/access.2021.3080315 |
| locations[1].id | pmh:oai:doaj.org/article:edaed21fe4ff43cc96acec291b0599f9 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306401280 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | cc-by-sa |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by-sa |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | IEEE Access, Vol 9, Pp 74028-74037 (2021) |
| locations[1].landing_page_url | https://doaj.org/article/edaed21fe4ff43cc96acec291b0599f9 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5084155458 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-9095-1288 |
| authorships[0].author.display_name | Dun-Wei Cheng |
| authorships[0].countries | TW |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I91807558 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan |
| authorships[0].institutions[0].id | https://openalex.org/I91807558 |
| authorships[0].institutions[0].ror | https://ror.org/01b8kcc49 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I91807558 |
| authorships[0].institutions[0].country_code | TW |
| authorships[0].institutions[0].display_name | National Cheng Kung University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Dun-Wei Cheng |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan |
| authorships[1].author.id | https://openalex.org/A5041018114 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Kai-Hsun Yao |
| authorships[1].countries | TW |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I91807558 |
| authorships[1].affiliations[0].raw_affiliation_string | Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan |
| authorships[1].institutions[0].id | https://openalex.org/I91807558 |
| authorships[1].institutions[0].ror | https://ror.org/01b8kcc49 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I91807558 |
| authorships[1].institutions[0].country_code | TW |
| authorships[1].institutions[0].display_name | National Cheng Kung University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Kai-Hsun Yao |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan |
| authorships[2].author.id | https://openalex.org/A5103047340 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-4746-3179 |
| authorships[2].author.display_name | Sun‐Yuan Hsieh |
| authorships[2].countries | TW |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I91807558 |
| authorships[2].affiliations[0].raw_affiliation_string | Department of Computer Science and Information Engineering, Institute of Medical Informatics and Center for Innovative FinTech Business Models, National Cheng Kung University, Tainan, Taiwan |
| authorships[2].institutions[0].id | https://openalex.org/I91807558 |
| authorships[2].institutions[0].ror | https://ror.org/01b8kcc49 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I91807558 |
| authorships[2].institutions[0].country_code | TW |
| authorships[2].institutions[0].display_name | National Cheng Kung University |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Sun-Yuan Hsieh |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Department of Computer Science and Information Engineering, Institute of Medical Informatics and Center for Innovative FinTech Business Models, National Cheng Kung University, Tainan, Taiwan |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://ieeexplore.ieee.org/ielx7/6287639/9312710/09431213.pdf |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10374 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998000264167786 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1703 |
| primary_topic.subfield.display_name | Computational Theory and Mathematics |
| primary_topic.display_name | Advanced Graph Theory Research |
| related_works | https://openalex.org/W4391375266, https://openalex.org/W2117159910, https://openalex.org/W2388449438, https://openalex.org/W4235411786, https://openalex.org/W2362357245, https://openalex.org/W2017241519, https://openalex.org/W2131919585, https://openalex.org/W4296605418, https://openalex.org/W4385493656, https://openalex.org/W2964130583 |
| cited_by_count | 8 |
| counts_by_year[0].year | 2023 |
| counts_by_year[0].cited_by_count | 5 |
| counts_by_year[1].year | 2022 |
| counts_by_year[1].cited_by_count | 2 |
| counts_by_year[2].year | 2021 |
| counts_by_year[2].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | doi:10.1109/access.2021.3080315 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S2485537415 |
| best_oa_location.source.issn | 2169-3536 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2169-3536 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | IEEE Access |
| best_oa_location.source.host_organization | https://openalex.org/P4310319808 |
| best_oa_location.source.host_organization_name | Institute of Electrical and Electronics Engineers |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310319808 |
| best_oa_location.source.host_organization_lineage_names | Institute of Electrical and Electronics Engineers |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://ieeexplore.ieee.org/ielx7/6287639/9312710/09431213.pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | IEEE Access |
| best_oa_location.landing_page_url | https://doi.org/10.1109/access.2021.3080315 |
| primary_location.id | doi:10.1109/access.2021.3080315 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S2485537415 |
| primary_location.source.issn | 2169-3536 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2169-3536 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | IEEE Access |
| primary_location.source.host_organization | https://openalex.org/P4310319808 |
| primary_location.source.host_organization_name | Institute of Electrical and Electronics Engineers |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319808 |
| primary_location.source.host_organization_lineage_names | Institute of Electrical and Electronics Engineers |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://ieeexplore.ieee.org/ielx7/6287639/9312710/09431213.pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | IEEE Access |
| primary_location.landing_page_url | https://doi.org/10.1109/access.2021.3080315 |
| publication_date | 2021-01-01 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W2028018414, https://openalex.org/W2051808028, https://openalex.org/W2116418681, https://openalex.org/W2729689113, https://openalex.org/W2013737355, https://openalex.org/W2577139425, https://openalex.org/W2066274820, https://openalex.org/W2094613978, https://openalex.org/W2123154881, https://openalex.org/W2567500060, https://openalex.org/W2998719837, https://openalex.org/W2022175859, https://openalex.org/W2953080657, https://openalex.org/W2003604039, https://openalex.org/W6611967347, https://openalex.org/W3048230596, https://openalex.org/W3034093661, https://openalex.org/W2035439570, https://openalex.org/W2011353132, https://openalex.org/W2079000395, https://openalex.org/W2128919165, https://openalex.org/W355627017, https://openalex.org/W2097755092 |
| referenced_works_count | 23 |
| abstract_inverted_index.a | 20, 71 |
| abstract_inverted_index.In | 35 |
| abstract_inverted_index.It | 17 |
| abstract_inverted_index.be | 6 |
| abstract_inverted_index.by | 76 |
| abstract_inverted_index.in | 9, 63 |
| abstract_inverted_index.is | 25 |
| abstract_inverted_index.of | 14, 19, 22 |
| abstract_inverted_index.on | 50 |
| abstract_inverted_index.to | 32, 45, 70, 81 |
| abstract_inverted_index.we | 38 |
| abstract_inverted_index.The | 0, 56 |
| abstract_inverted_index.and | 12, 66 |
| abstract_inverted_index.can | 5 |
| abstract_inverted_index.the | 10, 40, 51, 60, 68, 78, 84 |
| abstract_inverted_index.deal | 82 |
| abstract_inverted_index.each | 24 |
| abstract_inverted_index.more | 72 |
| abstract_inverted_index.path | 42 |
| abstract_inverted_index.this | 36 |
| abstract_inverted_index.used | 8 |
| abstract_inverted_index.with | 83 |
| abstract_inverted_index.apply | 39 |
| abstract_inverted_index.build | 46 |
| abstract_inverted_index.trees | 49 |
| abstract_inverted_index.work, | 37 |
| abstract_inverted_index.design | 11, 77 |
| abstract_inverted_index.issue. | 86 |
| abstract_inverted_index.loosen | 59 |
| abstract_inverted_index.result | 69 |
| abstract_inverted_index.series | 21 |
| abstract_inverted_index.vertex | 74 |
| abstract_inverted_index.widely | 7 |
| abstract_inverted_index.concept | 44 |
| abstract_inverted_index.general | 73 |
| abstract_inverted_index.graphs. | 55 |
| abstract_inverted_index.routing | 43 |
| abstract_inverted_index.setting | 75 |
| abstract_inverted_index.through | 27 |
| abstract_inverted_index.channels | 31 |
| abstract_inverted_index.consists | 18 |
| abstract_inverted_index.extended | 67 |
| abstract_inverted_index.previous | 64 |
| abstract_inverted_index.proposed | 57 |
| abstract_inverted_index.research | 65 |
| abstract_inverted_index.shortest | 41 |
| abstract_inverted_index.spanning | 48 |
| abstract_inverted_index.specific | 79 |
| abstract_inverted_index.strategy | 58 |
| abstract_inverted_index.algorithm | 80 |
| abstract_inverted_index.circulant | 3, 54 |
| abstract_inverted_index.connected | 26 |
| abstract_inverted_index.different | 33 |
| abstract_inverted_index.networks. | 16 |
| abstract_inverted_index.recursive | 2, 53 |
| abstract_inverted_index.conditions | 62 |
| abstract_inverted_index.constraint | 85 |
| abstract_inverted_index.neighbors. | 34 |
| abstract_inverted_index.networking | 4 |
| abstract_inverted_index.restricted | 61 |
| abstract_inverted_index.generalized | 1, 52 |
| abstract_inverted_index.independent | 47 |
| abstract_inverted_index.processors, | 23 |
| abstract_inverted_index.communication | 30 |
| abstract_inverted_index.bidirectional, | 28 |
| abstract_inverted_index.implementation | 13 |
| abstract_inverted_index.point-to-point | 29 |
| abstract_inverted_index.interconnection | 15 |
| cited_by_percentile_year.max | 98 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile.value | 0.82675197 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |