The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2009 vol.58)
pp: 528-540
Hee-Chul Kim , Hankuk University of Foreign Studies, Yongin-si
Hyeong-Seok Lim , Chonnam National University, Gwangju
ABSTRACT
A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k sources and k sinks in which each vertex of G is covered by a path. It is called a paired many-to-many disjoint path cover when each source should be joined to a specific sink, and it is called an unpaired many-to-many disjoint path cover when each source can be joined to an arbitrary sink. In this paper, we discuss about paired and unpaired many-to-many disjoint path covers including their relationships, application to strong Hamiltonicity, and necessary conditions. And then, we give a construction scheme for paired many-to-many disjoint path covers in the graph H_{0} \oplus H_{1} obtained from connecting two graphs H_{0} and H_{1} with |V(H_{0})| = |V(H_{1})| by |V(H_{0})| pairwise nonadjacent edges joining vertices in H_{0} and vertices in H_{1}, where H_{0} = G_{0} \oplus G_{1} and H_{1} = G_{2} \oplus G_{3} for some graphs G_{j}. Using the construction, we show that every m-dimensional restricted HL-graph and recursive circulant G(2^{m}, 4) with f or less faulty elements have a paired k-DPC for any f and k \geq 2 with f + 2k \leq m.
INDEX TERMS
Fault tolerance, disjoint path covers, interconnection networks, restricted HL-graphs, recursive circulants, strong Hamiltonicity, fault Hamiltonicity.
CITATION
Hee-Chul Kim, Hyeong-Seok Lim, "Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements", IEEE Transactions on Computers, vol.58, no. 4, pp. 528-540, April 2009, doi:10.1109/TC.2008.160
REFERENCES
[1] D.K. Biss, “Hamiltonian Decomposition of Recursive Circulant Graphs,” Discrete Math., vol. 214, pp. 89-99, 2000.
[2] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, fifthprinting, Am. Elsevier, 1976.
[3] C.-H. Chang, C.-K. Lin, H.-M. Huang, and L.-H. Hsu, “The Super Laceability of the Hypercubes,” Information Processing Letters, vol. 92, no. 1, pp. 15-21, 2004.
[4] F.B. Chedid, “On the Generalized Twisted Cube,” Information Processing Letters, vol. 55, pp. 49-52, 1995.
[5] X.-B. Chen, “Cycles Passing through Prescribed Edges in a Hypercube with Some Faulty Edges,” Information Processing Letters, vol. 104, no. 6, pp. 211-215, 2007.
[6] C.C. Chen and J. Chen, “Nearly Optimal One-to-Many Parallel Routing in Star Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 1196-1202, Dec. 1997.
[7] C.C. Chen and N.F. Quimpo, “On Strongly Hamiltonian Abelian Group Graphs,” Proc. Australian Conf. Combinatorial Math., pp. 23-34, 1980.
[8] P. Cull and S. Larson, “The Möbius Cubes,” Proc. Sixth IEEE Distributed Memory Computing Conf., pp. 699-702, 1991.
[9] T. Dvořák and P. Gregor, “Hamiltonian Paths with Prescribed Edges in Hypercubes,” Discrete Math., vol. 307, pp. 1982-1998, 2007.
[10] K. Efe, “A Variation on the Hypercube with Lower Diameter,” IEEE Trans. Computers, vol. 40, no. 11, pp. 1312-1316, Nov. 1991.
[11] K. Efe, “The Crossed Cube Architecture for Parallel Computation,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp.513-524, Sept. 1992.
[12] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[13] G. Gauyacq, C. Micheneau, and A. Raspaud, “Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition,” Proc. 24th Int'l Workshop Graph-Theoretic Concepts in Computer Science (WG '98), pp. 227-241, 1998.
[14] Q.P. Gu and S. Peng, “Cluster Fault-Tolerant Routing in Star Graphs,” Networks, vol. 35, no. 1, pp. 83-90, 2000.
[15] P.A.J. Hilbers, M.R.J. Koopman, and J.L.A. van de Snepscheut, “The Twisted Cube,” PARLE: Parallel Architectures and Languages Europe, J. Bakker, A. Nijman, and P. Treleaven, eds., vol. 1, pp.152-159, 1987.
[16] S.-Y. Hsieh, G.-H. Chen, and C.-W. Ho, “Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 3, pp. 223-237, Mar. 1999.
[17] H.-C. Hsu, T.-K. Li, J.J.M. Tan, and L.-H. Hsu, “Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs,” IEEE Trans. Computers, vol. 53, no. 1, pp. 39-53, Jan. 2004.
[18] P.-L. Lai and H.-C. Hsu, “On the Two-Equal-Disjoint Path Cover Problem of Crossed Cubes,” Proc. Ninth Joint Int'l Conf. Information Sciences (JCIS '06), pp. 603-606, Oct. 2006.
[19] H.-S. Lim, J.-H. Park, and K.-Y. Chwa, “Embedding Trees into Recursive Circulants,” Discrete Applied Math., vol. 69, pp. 83-99, 1996.
[20] C.-D. Park and K.Y. Chwa, “Hamiltonian Properties on the Class of Hypercube-Like Networks,” Information Processing Letters, vol. 91, pp. 11-17, 2004.
[21] J.-H. Park, “Hamiltonian Decomposition of Recursive Circulants,” Proc. Int'l Symp. Algorithms and Computation (ISAAC '98), pp. 297-306, 1998.
[22] J.-H. Park, “One-to-One Disjoint Path Covers in Recursive Circulants,” J. Korea Information Science Soc., vol. 30, no. 12, pp.691-698, 2003 (in Korean).
[23] J.-H. Park, “One-to-Many Disjoint Path Covers in a Graph with Faulty Elements,” Proc. Int'l Computing and Combinatorics Conf. (COCOON '04), pp. 392-401, Aug. 2004.
[24] J.-H. Park, “Many-to-Many Disjoint Path Covers in Double LoopNetworks,” J. Korea Information Science Soc., vol. 32, no. 8, pp. 426-431, 2005 (in Korean).
[25] J.-H. Park, “Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks,” J. Korea Information Science Soc., vol. 33, no. 10, pp. 789-796, 2006 (in Korean).
[26] J.-H. Park and K.Y. Chwa, “Recursive Circulants and Their Embeddings among Hypercubes,” Theoretical Computer Science, vol. 244, pp. 35-62, 2000.
[27] J.-H. Park, H.-C. Kim, and H.-S. Lim, “Fault-Hamiltonicity of Hypercube-Like Interconnection Networks,” Proc. 19th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '05), Apr. 2005.
[28] J.-H. Park, H.-C. Kim, and H.-S. Lim, “Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 3, pp. 227-240, Mar. 2006.
[29] J.-H. Park and J.-H. Lee, Unpaired Many-to-Many Disjoint Path Covers in Recursive Circulant $G(2^{m}, 4)$ , manuscript (submitted for publication).
[30] J.-H. Park, H.-S. Lim, and H.-C. Kim, “Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements,” Theoretical Computer Science, vol. 377, nos. 1-3, pp.170-180, 2007.
[31] N.K. Singhvi and K. Ghose, “The Mcube: A Symmetrical Cube Based Network with Twisted Links,” Proc. Ninth IEEE Int'l Parallel Processing Symp. (IPPS '95), pp. 11-16, 1995.
[32] C.-H. Tsai, J.J.M. Tan, Y.-C. Chuang, and L.-H. Hsu, “Fault-Free Cycles and Links in Faulty Recursive Circulant Graphs,” Proc. ICS Workshop Algorithms and Theory of Computation, pp. 74-77, 2000.
[33] C.-H. Tsai, J.J.M. Tan, and L.-H. Hsu, “The Super-Connected Property of Recursive Circulant Graphs,” Information Processing Letters, vol. 91, no. 6, pp. 293-298, 2004.
[34] 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, vol. 8, no. 12, pp.1185-1195, Dec. 1997.
[35] A.S. Vaidya, P.S.N. Rao, and S.R. Shankar, “A Class of Hypercube-Like Networks,” Proc. Fifth IEEE Symp. Parallel and Distributed Processing (SPDP '93), pp. 800-803, Dec. 1993.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool