Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks
Published 2020 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks
Authors
Keywords
-
Journal
JOURNAL OF SUPERCOMPUTING
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2020-05-04
DOI
10.1007/s11227-020-03297-9
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- A protection routing with secure mechanism in Möbius cubes
- (2020) Kung-Jui Pai et al. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
- A two-stages tree-searching algorithm for finding three completely independent spanning trees
- (2019) Kung-Jui Pai et al. THEORETICAL COMPUTER SCIENCE
- Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks
- (2019) Kung-Jui Pai et al. IEEE-ACM TRANSACTIONS ON NETWORKING
- Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes
- (2019) Yi-Xian YANG et al. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- The Existence of Completely Independent Spanning Trees for Some Compound Graphs
- (2019) Xiao-Wen Qin et al. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
- A well-equalized 3-CIST partition of alternating group graphs
- (2019) Kung-Jui Pai et al. INFORMATION PROCESSING LETTERS
- Completely independent spanning trees in k-th power of graphs
- (2018) Xia Hong Discussiones Mathematicae Graph Theory
- Constructing spanning trees in augmented cubes
- (2018) S.A. Mane et al. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
- Improving the diameters of completely independent spanning trees in locally twisted cubes
- (2018) Kung-Jui Pai et al. INFORMATION PROCESSING LETTERS
- Completely Independent Spanning Trees on 4-Regular Chordal Rings
- (2017) Jou-Ming CHANG et al. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT
- Chromatic properties of the Pancake graphs
- (2017) Elena Konstantinova Discussiones Mathematicae Graph Theory
- Completely Independent Spanning Trees on 4-Regular Chordal Rings
- (2017) Jou-Ming CHANG et al. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- 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
- Pancake Flipping is hard
- (2015) Laurent Bulteau et al. JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- Completely independent spanning trees in (partial) k-trees
- (2015) Toru Araki et al. Discussiones Mathematicae Graph Theory
- 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
- Completely Independent Spanning Trees on Some Interconnection Networks
- (2014) Kung-Jui PAI et al. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- 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
- 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
- Mutually independent hamiltonian cycles for the pancake graphs and the star graphs
- (2009) Cheng-Kuan Lin et al. DISCRETE MATHEMATICS
- An (18/11)n upper bound for sorting by prefix reversals
- (2008) B. Chitturi et al. THEORETICAL COMPUTER SCIENCE
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreDiscover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversation