Browse > Article

Many-to-Many Disjoint Path Covers in Double Loop Networks  

Park Jung-Heum (카톨릭대학교 컴퓨터정보공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.32, no.8, 2005 , pp. 426-431 More about this Journal
Abstract
A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate many-to-many 2-DPC in a double loop network G(mn;1,m), and show that every nonbipartite G(mn;1,m), $m{\geq}3$, has 2-DPC joining any two source-sink pairs of vertices and that every bipartite G(mn;1,m) has 2-DPC joining any two source-sink pairs of black-white vertices and joining any Pairs of black-black and white-white vertices. G(mn;l,m) is bipartite if and only if n is odd and n is even.
Keywords
Disjoint path covers; double loop networks; strong hamiltonicity; interconnection networks; circulant graphs;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 J.-H. Park and H.-C. Kim, 'Fault-hamiltonicity of product graph of path and cycle,' in Proc. of International Computing and Combinatorics Conference COCOON2003 (LNCS #2697), MT, USA, pp. 319-328, 2003
2 C.C. Chen and N.F. Quimpo, 'On strongly hamiltonian abelian group graphs,' in. Australian Conference on Combinatorial Mathematics (Lecture Notes in Mathematics #884), pp. 23-34, 1980
3 H.-C. Kim and J.-H. Park, 'Fault hamiltonicity of two-dimensional torus networks,' in Proc. of Workshop on Algorithms and Computation WAAC'00, Tokyo, Japan, pp. 110-117, 2000
4 J.-H. Park and H.-C. Kim, 'Fault hamiltonicity of double loop networks G(mn;1,m) with even m and n,' Journal of KISS, 27(10), pp. 868-879, 2000
5 C.-H. Tsai, J.J.M. Tan, Y.-C. Chuang, and L.-H. Hsu, 'Fault-free cycles and links in faulty recursive circulant graphs,' in Proc. of Workshop on Algorithms and Theory of Computation ISC2000, pp. 74-77, 2000
6 J.-H. Park, 'Fault-hamiltonicity of bipartite double loop networks,' Journal of KISS, 31(1), pp. 19-26, 2004   과학기술학회마을
7 Y.-C. Tseng, S.-H. Chang, and J.-P. Sheu, 'Fault-tolerant ring embedding in a star graph with both link and node failures,' IEEE Trans. Parallel and Distributed Systems, 8(12), pp. 1185-1195, Dec. 1997   DOI   ScienceOn
8 J.-H. Park, H.-C. Kim, and H.-S. Lim, 'Faulthamiltonicity of hypercube-like interconnection networks,' in Proc. of the IEEE International Parallel & Distributed Processing Symposium IPDPS 2005, Apr. 2005
9 A. Sengupta, 'On ring embedding in hypercubes with faulty nodes and links,' Inform. Proc. Lett., 68, pp. 207-214, 1998   DOI   ScienceOn
10 D.J. Guan, 'An optimal message routing algorithm for double-loop networks,' Inform. Proc. Lett., 65(5), pp. 255-260, 1998   DOI   ScienceOn
11 T.-Y. Sung, C.-Y. Lin, Y.-C. Chuang, and L.-H. Hsu, 'Fault tolerant token ring embedding in double loop networks,' Inform. Proc. Lett., 66, pp. 201-207, 1998   DOI   ScienceOn
12 J.-H. Park, H.-C. Kim, and H.-S. Lim, 'Manyto-many disjoint path covers in hypercube-like interconnection networks with faulty elements,' IEEE Trans. Parallel and Distributed Systems, 2005 (to appear)
13 C.-y. Chou, D.J. Guan, and K.-l. Wang, 'A dynamic fault-tolerant message routing algorithm for double-loop networks,' Inform. Proc. Lett., 70(6), pp. 259-264, 1999   DOI   ScienceOn
14 C.-H. Tsai, J.J.M. Tan, and L.-H. Hsu, 'The super-connected property of recursive circulant graphs,' Inform. Proc. Lett., 91(6), pp. 293-298, 2004   DOI   ScienceOn
15 J.-H. Park, 'One-to-one disjoint path covers in recursive circulants,' Journal of KISS, 30(12), pp. 691-698, 2003   과학기술학회마을
16 C.-H. Chang, C.-K. Lin, H.-M. Huang, and L.-H. Hsu, 'The super laceability of the hypercubes,' Inform. Proc. Lett., 92(1), pp. 15-21, 2004   DOI   ScienceOn
17 J.-H. Park, 'One-to-many disjoint path covers in a graph with faulty elements,' in Proc. of the International Computing and Combinatorics Conference COCOON 2004, pp. 392-401, Aug. 2004
18 J.-H. Park, H.-C. Kim, and H.-S. Lim, 'Manyto-many disjoint path covers in a graph with faulty elements,' in Proc. of the International Symposium on Algorithms and Computation ISAAC 2004, pp. 742-753, Dec. 2004