Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes

[1]  Ruay-Shiung Chang,et al.  Three completely independent spanning trees of crossed cubes with application to secure-protection routing , 2020, Inf. Sci..

[2]  Chiuyuan Chen,et al.  Constructing independent spanning trees for locally twisted cubes , 2011, Theor. Comput. Sci..

[3]  Ferenc Péterfalvi,et al.  Two counterexamples on completely independent spanning trees , 2012, Discret. Math..

[4]  Jou-Ming Chang,et al.  Constructing dual-CISTs of DCell data center networks , 2019, Appl. Math. Comput..

[5]  Hiroshi Nagamochi,et al.  Independent spanning trees with small depths in iterated line digraphs , 2001, Discret. Appl. Math..

[6]  Jianxi Fan,et al.  Constructing completely independent spanning trees in crossed cubes , 2017, Discret. Appl. Math..

[7]  Dajin Wang,et al.  Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube , 2021, IEEE Transactions on Parallel and Distributed Systems.

[8]  Shuming Zhou,et al.  Fault diagnosability of Bicube networks under the PMC diagnostic model , 2021, Theor. Comput. Sci..

[9]  Kung-Jui Pai,et al.  Constructing dual-CISTs of folded divide-and-swap cubes , 2021, Theor. Comput. Sci..

[10]  Xiao-Wen Qin,et al.  The Existence of Completely Independent Spanning Trees for Some Compound Graphs , 2020, IEEE Transactions on Parallel and Distributed Systems.

[11]  Jou-Ming Chang,et al.  Reducing the Height of Independent Spanning Trees in Chordal Rings , 2007, IEEE Transactions on Parallel and Distributed Systems.

[12]  B. N. Waphare,et al.  Constructing spanning trees in augmented cubes , 2018, J. Parallel Distributed Comput..

[13]  Ruay-Shiung Chang,et al.  A two-stages tree-searching algorithm for finding three completely independent spanning trees , 2019, Theor. Comput. Sci..

[14]  Krishnan Padmanabhan,et al.  the Twisted Cube Topology for Multiprocessors: A Study in Network Asymmetry , 1991, J. Parallel Distributed Comput..

[15]  Toru Hasunuma,et al.  Completely Independent Spanning Trees in Maximal Planar Graphs , 2002, WG.

[16]  Xiao-Wen Qin,et al.  Reliability analysis based on the dual-CIST in shuffle-cubes , 2021, Appl. Math. Comput..

[17]  Yi-Xian YANG,et al.  Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes , 2019, IEICE Trans. Inf. Syst..

[18]  Jou-Ming Chang,et al.  Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars , 2015, Comput. J..

[19]  János Tapolcai,et al.  Sufficient conditions for protection routing in IP networks , 2013, Optim. Lett..

[20]  Kung-Jui Pai,et al.  Completely Independent Spanning Trees on Some Interconnection Networks , 2014, IEICE Trans. Inf. Syst..

[21]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[22]  Peter A. J. Hilbers,et al.  The Twisted Cube , 1987, PARLE.

[23]  Kung-Jui Pai,et al.  Improving the diameters of completely independent spanning trees in locally twisted cubes , 2019, Inf. Process. Lett..

[24]  Paul Cull,et al.  The Möbius Cubes , 1995, IEEE Trans. Computers.

[25]  Ruay-Shiung Chang,et al.  A protection routing with secure mechanism in Möbius cubes , 2020, J. Parallel Distributed Comput..

[26]  Hyeong-Seok Lim,et al.  The bicube: an interconnection of two hypercubes , 2015, Int. J. Comput. Math..

[27]  Kung-Jui Pai,et al.  Constructing two completely independent spanning trees in hypercube-variant networks , 2016, Theor. Comput. Sci..

[28]  Kung-Jui Pai,et al.  Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks , 2019, IEEE/ACM Transactions on Networking.

[29]  Kemal Efe,et al.  The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..

[30]  Saïd Bettayeb,et al.  Multiply-Twisted Hypercube with Five or More Dimensions is not Vertex-Transitive , 1995, Inf. Process. Lett..

[31]  David J. Evans,et al.  The locally twisted cubes , 2005, Int. J. Comput. Math..

[32]  Toru Hasunuma,et al.  Completely independent spanning trees in the underlying graph of a line digraph , 2000, Discret. Math..

[33]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..