2021
DOI: 10.1109/access.2021.3049290
|View full text |Cite
|
Sign up to set email alerts
|

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 40 publications
(47 reference statements)
0
2
0
Order By: Relevance
“…From then on, this conjecture has been confirmed only for k-connected graphs with k ≤ 4 (see [9,10,14]). Since this conjecture is still unsolved for general k-connected graphs for k ≥ 5, the follow-up research mainly focused on the study of constructing ISTs on specific interconnection networks, e.g., the construction of ISTs on some variations of hypercubes [3,20,29,30,37], torus networks [28], recursive circulant graphs [34,35], and special subclasses of Cayley networks [7,8,12,13,15,19,39]. In particular, special topics related to ISTs include the research on reducing the height of the ISTs [31,33,36] and parallel construction of ISTs [4-6, 32, 37, 38].…”
Section: Introductionmentioning
confidence: 99%
“…From then on, this conjecture has been confirmed only for k-connected graphs with k ≤ 4 (see [9,10,14]). Since this conjecture is still unsolved for general k-connected graphs for k ≥ 5, the follow-up research mainly focused on the study of constructing ISTs on specific interconnection networks, e.g., the construction of ISTs on some variations of hypercubes [3,20,29,30,37], torus networks [28], recursive circulant graphs [34,35], and special subclasses of Cayley networks [7,8,12,13,15,19,39]. In particular, special topics related to ISTs include the research on reducing the height of the ISTs [31,33,36] and parallel construction of ISTs [4-6, 32, 37, 38].…”
Section: Introductionmentioning
confidence: 99%
“…Pancake-like graphs have been studied for sorting problems [2,3,[7][8][9][10], interconnection networks in computer science [11][12][13][14][15][16], and DNA computing models in biology [17][18][19][20][21]. Finding a graph with a small network cost is like a high-performance interconnection network and a good sorting algorithm [22].…”
Section: Introductionmentioning
confidence: 99%