- Home
- Publications
- Publication Search
- Publication Details
Title
Reliability analysis based on the dual-CIST in shuffle-cubes
Authors
Keywords
Completely independent spanning tree, Shuffle-cube, CIST-partition, recursive algorithm
Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 397, Issue -, Pages 125900
Publisher
Elsevier BV
Online
2021-01-19
DOI
10.1016/j.amc.2020.125900
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks
- (2019) Kung-Jui Pai et al. IEEE-ACM TRANSACTIONS ON NETWORKING
- Constructing dual-CISTs of DCell data center networks
- (2019) Xiao-Wen Qin et al. APPLIED MATHEMATICS AND COMPUTATION
- The Existence of Completely Independent Spanning Trees for Some Compound Graphs
- (2019) Xiao-Wen Qin et al. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
- Degree condition for completely independent spanning trees
- (2016) Xia Hong et al. INFORMATION PROCESSING LETTERS
- Constructing two completely independent spanning trees in hypercube-variant networks
- (2016) Kung-Jui Pai et al. THEORETICAL COMPUTER SCIENCE
- A Note on the Degree Condition of Completely Independent Spanning Trees
- (2015) Hung-Yi CHANG et al. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT
- A Note on the Degree Condition of Completely Independent Spanning Trees
- (2015) Hung-Yi CHANG et al. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- Ore’s condition for completely independent spanning trees
- (2014) Genghua Fan et al. DISCRETE APPLIED MATHEMATICS
- Conditional diagnosability and strong diagnosability of shuffle-cubes under the comparison model
- (2014) Limei Lin et al. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
- Dirac's Condition for Completely Independent Spanning Trees
- (2013) Toru Araki JOURNAL OF GRAPH THEORY
- Two counterexamples on completely independent spanning trees
- (2012) Ferenc Péterfalvi DISCRETE MATHEMATICS
- Sufficient conditions for protection routing in IP networks
- (2012) János Tapolcai Optimization Letters
- An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs
- (2011) S. Srinivasagopalan et al. IEEE TRANSACTIONS ON COMPUTERS
- On the Feasibility and Efficacy of Protection Routing in IP Networks
- (2011) Kin-Wah Kwong et al. IEEE-ACM TRANSACTIONS ON NETWORKING
- Completely independent spanning trees in torus networks
- (2011) Toru Hasunuma et al. NETWORKS
- The conditional diagnosability of shuffle-cubes
- (2010) Min Xu et al. Journal of Systems Science & Complexity
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started