Optimal construction of node-disjoint shortest paths in folded hypercubes

Chen, 2009, Many-to-many disjoint paths in faulty hypercubes, Inform. Sci., 179, 3110, 10.1016/j.ins.2009.05.006 Chen, 1997, Nearly optimal one-to-many parallel routing in star networks, IEEE Trans. Parallel Distrib. Syst., 8, 1196, 10.1109/71.640011 M. Dietzfelbinger, S. Madhavapeddy, I.H. Sudborough, Three disjoint path paradigms in star networks, in: Proceedings of the third IEEE Symposium on Parallel and Distributed Processing, 1991, pp. 400–406. Duh, 1997, On the Rabin number problem, Networks, 30, 219, 10.1002/(SICI)1097-0037(199710)30:3<219::AID-NET6>3.0.CO;2-O El-Amawy, 1991, Properties and performance of folded hypercubes, IEEE Trans. Parallel Distrib. Syst., 2, 31, 10.1109/71.80187 Fang, 2007, The bipanconnectivity and m-panconnectivity of the folded hypercube, Theoret. Comput. Sci., 385, 286, 10.1016/j.tcs.2007.07.005 Fu, 2008, Fault-free cycles in folded hypercubes with more faulty elements, Inform. Process. Lett., 108, 261, 10.1016/j.ipl.2008.05.024 Galil, 1986, Efficient algorithms for finding maximum matching in graphs, ACM Comput. Surv., 18, 23, 10.1145/6462.6502 Gao, 2009, Short containers in Cayley graphs, Discrete Appl. Math., 157, 1354, 10.1016/j.dam.2008.11.005 Gu, 1998, Node-to-set and set-to-set cluster fault tolerant routing in hypercubes, Parallel Comput., 24, 1245, 10.1016/S0167-8191(98)00050-7 Gu, 2000, An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes, J. Parallel Distrib. Comput., 60, 764, 10.1006/jpdc.2000.1632 Hsieh, 2007, Some edge-fault-tolerant properties of the folded hypercube, Networks, 51, 92, 10.1002/net.20204 Hsieh, 2009, A further result on fault-free cycles in faulty folded hypercubes, Inform. Process. Lett., 110, 41, 10.1016/j.ipl.2009.10.003 Hsieh, 2009, 1-Vertex-fault-tolerant cycles embedding on folded hypercubes, Discrete Appl. Math., 157, 3094, 10.1016/j.dam.2009.06.012 Hsieh, 2013, Strong diagnosability and conditional diagnosability of multiprocessor systems and folded hypercubes, IEEE Trans. Comput., 62, 1472, 10.1109/TC.2012.110 Kuo, 2013, Fault-tolerant path embedding in folded hypercubes with both node and edge faults, Theoret. Comput. Sci., 475, 82, 10.1016/j.tcs.2012.11.028 Kuo, 2010, Pancyclicity and bipancyclicity of conditional faulty folded hypercubes, Inform. Sci., 180, 2904, 10.1016/j.ins.2010.04.003 Lai, 2012, Optimal construction of all shortest node-disjoint paths in hypercubes with applications, IEEE Trans. Parallel Distrib. Syst., 23, 1129, 10.1109/TPDS.2011.261 Lai, 2014, An efficient construction of one-to-many node-disjoint paths in folded hypercubes, J. Parallel Distrib. Comput., 74, 2310, 10.1016/j.jpdc.2013.12.005 Lai, 2015, Constructing all shortest node-disjoint paths in torus networks, J. Parallel Distrib. Comput., 75, 123, 10.1016/j.jpdc.2014.09.004 Lai, 2016, On the construction of all shortest node-disjoint paths in star networks, Inform. Process. Lett., 116, 299, 10.1016/j.ipl.2015.11.003 Liaw, 1999, Generalized diameters and Rabin numbers of networks, J. Comb. Optim., 4, 371 Ma, 2010, The spanning connectivity of folded hypercubes, Inform. Sci., 180, 3373, 10.1016/j.ins.2010.05.015 Rabin, 1989, Efficient dispersal of information for security, load balancing, and fault tolerance, J. ACM, 36, 335, 10.1145/62044.62050 Saad, 1988, Topological properties of hypercubes, IEEE Trans. Comput., 37, 867, 10.1109/12.2234 Wang, 2001, Embedding Hamiltonian cycles into folded hypercubes with faulty links, J. Parallel Distrib. Comput., 61, 545, 10.1006/jpdc.2000.1681 Wu, 2007, Node-disjoint paths in hierarchical hypercube networks, Inform. Sci., 177, 4200, 10.1016/j.ins.2007.02.035 Xiang, 2010, One-to-many node-disjoint paths in (n, k)-star graphs, Discrete Appl. Math., 158, 62, 10.1016/j.dam.2009.08.013 Xu, 2006, Cycles in folded hypercubes, Appl. Math. Lett., 19, 140, 10.1016/j.aml.2005.04.002 Zhu, 2007, On reliability of the folded hypercubes, Inform. Sci., 177, 1782, 10.1016/j.ins.2006.11.003