Three completely independent spanning trees of crossed cubes with application to secure-protection routing
暂无分享,去创建一个
[1] Hung-Yi Chang,et al. A Note on the Degree Condition of Completely Independent Spanning Trees , 2015, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[2] Lih-Hsing Hsu,et al. Edge Congestion and Topological Properties of Crossed Cubes , 2000, IEEE Trans. Parallel Distributed Syst..
[3] Saïd Bettayeb,et al. Multiply-Twisted Hypercube with Five or More Dimensions is not Vertex-Transitive , 1995, Inf. Process. Lett..
[4] Xiaohua Jia,et al. Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes , 2013, J. Parallel Distributed Comput..
[5] Olivier Togni,et al. Completely independent spanning trees in some regular graphs , 2014, Discret. Appl. Math..
[6] Kung-Jui Pai,et al. Constructing two completely independent spanning trees in hypercube-variant networks , 2016, Theor. Comput. Sci..
[7] Zhi-Li Zhang,et al. On the Feasibility and Efficacy of Protection Routing in IP Networks , 2010, IEEE/ACM Transactions on Networking.
[8] Kung-Jui Pai,et al. Completely Independent Spanning Trees on Some Interconnection Networks , 2014, IEICE Trans. Inf. Syst..
[9] Jou-Ming Chang,et al. Constructing dual-CISTs of DCell data center networks , 2019, Appl. Math. Comput..
[10] Hung-Yi Chang,et al. Completely Independent Spanning Trees on 4-Regular Chordal Rings , 2017, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[11] Tao Xiang,et al. Independent spanning trees in crossed cubes , 2013, Inf. Process. Lett..
[12] Hon-Chan Chen,et al. A note on path embedding in crossed cubes with faulty vertices , 2017, Inf. Process. Lett..
[13] Kemal Efe,et al. The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..
[14] János Tapolcai,et al. Sufficient conditions for protection routing in IP networks , 2013, Optim. Lett..
[15] Toru Hasunuma,et al. Completely independent spanning trees in the underlying graph of a line digraph , 2000, Discret. Math..
[16] Ferenc Péterfalvi,et al. Two counterexamples on completely independent spanning trees , 2012, Discret. Math..
[17] Zhao Liu,et al. Constructing independent spanning trees with height n on the n-dimensional crossed cube , 2018, Future Gener. Comput. Syst..
[18] Qinghai Liu,et al. Ore's condition for completely independent spanning trees , 2014, Discret. Appl. Math..
[19] Yota Otachi,et al. Completely Independent Spanning Trees in (Partial) k-Trees , 2015, Discuss. Math. Graph Theory.
[20] Kung-Jui Pai,et al. A comment on "Independent spanning trees in crossed cubes" , 2014, Inf. Process. Lett..
[21] Xiaohua Jia,et al. Independent spanning trees in crossed cubes , 2013, Inf. Process. Lett..
[22] Toru Hasunuma,et al. Completely independent spanning trees in torus networks , 2012, Networks.
[23] Jianxi Fan,et al. Constructing completely independent spanning trees in crossed cubes , 2017, Discret. Appl. Math..
[24] Toru Araki,et al. Dirac's Condition for Completely Independent Spanning Trees , 2014, J. Graph Theory.
[25] Qinghai Liu,et al. Degree condition for completely independent spanning trees , 2016, Inf. Process. Lett..
[26] Kemal Efe,et al. Topological Properties of the Crossed Cube Architecture , 1994, Parallel Comput..