Pairwise Disjoint Paths in Pancake Graphs
暂无分享,去创建一个
[1] P. F. Corbett,et al. Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks , 1992, IEEE Trans. Parallel Distributed Syst..
[2] Christos H. Papadimitriou,et al. Bounds for sorting by prefix reversal , 1979, Discret. Math..
[3] Lih-Hsing Hsu,et al. Embedding Hamiltonian paths and Hamiltonian cycles in faulty pancake graphs , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.
[4] Keiichi Kaneko,et al. Computing the Diameter of 17-Pancake Graph Using a PC Cluster , 2006, Euro-Par.
[5] Ivan Hal Sudborough,et al. Pancake problems with restricted prefix reversals and some corresponding Cayley networks , 2003, J. Parallel Distributed Comput..
[6] D.Frank Hsu,et al. On Container Width and Length in Graphs, Groups,and Networks--Dedicated to Professor Paul Erdös on the occasion of his 80th birthday-- , 1994 .
[7] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.
[8] Yasuto Suzuki,et al. Node-to-set disjoint paths problem in pancake graphs , 2003 .
[9] Shietung Peng,et al. An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes , 2000, J. Parallel Distributed Comput..
[10] Shietung Peng,et al. An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs , 1998, Inf. Process. Lett..
[11] Pradip K. Srimani,et al. Trivalent Cayley Graphs for Interconnection Networks , 1995, Inf. Process. Lett..
[12] Yasuto Suzuki,et al. An Algorithm for Node-Disjoint Paths in Pancake Graphs , 2003 .