메뉴 건너뛰기




Volumn 159, Issue 4, 2011, Pages 212-223

Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements

Author keywords

Fault tolerance; Interconnection network; k ary n cube; Panconnectivity; Path embedding; Torus

Indexed keywords

COMMONLY USED; EDGE-PANCYCLICITY; FAULT-TOLERANT CAPABILITY; FAULTY ELEMENTS; FREE PATH; INTERCONNECTION TOPOLOGIES; K-ARY N-CUBE; K-ARY N-CUBES; ODD INTEGERS; PANCONNECTIVITY; PANCYCLICITY; PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS; PATH EMBEDDING; TORUS; TORUS NETWORKS;

EID: 78650737792     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.10.015     Document Type: Article
Times cited : (24)

References (26)
  • 1
    • 10644245978 scopus 로고    scopus 로고
    • Fault-tolerant embeddings of hamiltonian circuits in k-ary n-cubes
    • Y.A. Ashir, and I.A. Stewart Fault-tolerant embeddings of hamiltonian circuits in k-ary n-cubes SIAM J. Discrete Math. 15 2002 317 328
    • (2002) SIAM J. Discrete Math. , vol.15 , pp. 317-328
    • Ashir, Y.A.1    Stewart, I.A.2
  • 2
    • 0035877303 scopus 로고    scopus 로고
    • Embedding complete trees into the hypercube
    • S.L. Bezrukov Embedding complete trees into the hypercube Discrete Appl. Math. 110 2001 101 119
    • (2001) Discrete Appl. Math. , vol.110 , pp. 101-119
    • Bezrukov, S.L.1
  • 3
    • 49149120095 scopus 로고    scopus 로고
    • Embedding graphs as isometric medians
    • P. Dankelmann, and G. Sabidussi Embedding graphs as isometric medians Discrete Appl. Math. 156 2008 2420 2422
    • (2008) Discrete Appl. Math. , vol.156 , pp. 2420-2422
    • Dankelmann, P.1    Sabidussi, G.2
  • 4
  • 5
    • 70350571716 scopus 로고    scopus 로고
    • Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
    • Q. Dong, X. Yang, and D. Wang Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links Inform. Sci. 180 2010 198 208
    • (2010) Inform. Sci. , vol.180 , pp. 198-208
    • Dong, Q.1    Yang, X.2    Wang, D.3
  • 6
    • 33845942063 scopus 로고    scopus 로고
    • Dense sets and embedding binary trees into hypercubes
    • T. Dvok Dense sets and embedding binary trees into hypercubes Discrete Appl. Math. 155 2007 506 514
    • (2007) Discrete Appl. Math. , vol.155 , pp. 506-514
    • Dvok, T.1
  • 7
    • 34548685213 scopus 로고    scopus 로고
    • The bipanconnectivity and m-panconnectivity of the folded hypercube
    • J.-F. Fang The bipanconnectivity and m-panconnectivity of the folded hypercube Theoret. Comput. Sci. 385 2007 286 300
    • (2007) Theoret. Comput. Sci. , vol.385 , pp. 286-300
    • Fang, J.-F.1
  • 9
    • 33845700384 scopus 로고    scopus 로고
    • Optimal fault-tolerant embedding of paths in twisted cubes
    • DOI 10.1016/j.jpdc.2006.04.004, PII S0743731506000943
    • J. Fan, X. Lin, Y. Pan, and X. Jia Optimal fault-tolerant embedding of paths in twisted cubes J. Parallel Distrib. Comput. 67 2007 205 214 (Pubitemid 44969963)
    • (2007) Journal of Parallel and Distributed Computing , vol.67 , Issue.2 , pp. 205-214
    • Fan, J.1    Lin, X.2    Pan, Y.3    Jia, X.4
  • 10
    • 0038044877 scopus 로고    scopus 로고
    • Efficient embeddings of ternary trees into hypercubes
    • A.K. Gupta, D. Nelson, and H. Wang Efficient embeddings of ternary trees into hypercubes J. Parallel Distrib. Comput. 63 2003 619 629
    • (2003) J. Parallel Distrib. Comput. , vol.63 , pp. 619-629
    • Gupta, A.K.1    Nelson, D.2    Wang, H.3
  • 12
    • 34548548396 scopus 로고    scopus 로고
    • Panconnectivity and edge-pancyclicity of 3-ary N-cubes
    • S.-Y. Hsieh, T.-J. Lin, and H.-L. Huang Panconnectivity and edge-pancyclicity of 3-ary N-cubes J. Supercomput. 42 2007 225 233
    • (2007) J. Supercomput. , vol.42 , pp. 225-233
    • Hsieh, S.-Y.1    Lin, T.-J.2    Huang, H.-L.3
  • 13
    • 45849094464 scopus 로고    scopus 로고
    • Edge-bipancyclicity of a hypercube with faulty vertices and edges
    • S.-Y. Hsieh, and T.-H. Shen Edge-bipancyclicity of a hypercube with faulty vertices and edges Discrete Appl. Math. 156 2008 1802 1808
    • (2008) Discrete Appl. Math. , vol.156 , pp. 1802-1808
    • Hsieh, S.-Y.1    Shen, T.-H.2
  • 14
    • 0742268825 scopus 로고    scopus 로고
    • Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphs
    • 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. Comput. 53 2004 39 53
    • (2004) IEEE Trans. Comput. , vol.53 , pp. 39-53
    • Hsu, H.-C.1    Li, T.-K.2    Tan, J.J.M.3    Hsu, L.-H.4
  • 18
    • 21844488639 scopus 로고
    • On rank versus communication complexity
    • N. Nisan, and A. Wigderson On rank versus communication complexity Combinatorica 15 1995 557 565
    • (1995) Combinatorica , vol.15 , pp. 557-565
    • Nisan, N.1    Wigderson, A.2
  • 20
    • 37349045289 scopus 로고    scopus 로고
    • Panconnectivity and edge-pancyclicity of faulty recursive circulant G (2m, 4)
    • J.-H. Park Panconnectivity and edge-pancyclicity of faulty recursive circulant G (2 m, 4 ) Theoret. Comput. Sci. 390 2008 70 80
    • (2008) Theoret. Comput. Sci. , vol.390 , pp. 70-80
    • Park, J.-H.1
  • 21
    • 32044444634 scopus 로고    scopus 로고
    • Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
    • 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 Distrib. Syst. 17 2006 227 240
    • (2006) IEEE Trans. Parallel Distrib. Syst. , vol.17 , pp. 227-240
    • Park, J.-H.1    Kim, H.-C.2    Lim, H.-S.3
  • 22
    • 34247608120 scopus 로고    scopus 로고
    • Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
    • J.-H. Park, H.-S. Lim, and H.-C. Kim Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements Theoret. Comput. Sci. 377 2007 170 180
    • (2007) Theoret. Comput. Sci. , vol.377 , pp. 170-180
    • Park, J.-H.1    Lim, H.-S.2    Kim, H.-C.3
  • 23
    • 72449186459 scopus 로고
    • IWarp: A 100-MOPS, LIW microprocessor for multicomputers
    • C. Peterson, J. Sutton, and P. Wiley iWarp: a 100-MOPS, LIW microprocessor for multicomputers IEEE Micro 11 1991 26 29 8187
    • (1991) IEEE Micro , vol.11 , pp. 26-29
    • Peterson, C.1    Sutton, J.2    Wiley, P.3
  • 24
    • 47349099225 scopus 로고    scopus 로고
    • Embedding long paths in k-ary n-cubes with faulty nodes and links
    • I.A. Stewart, and Y. Xiang Embedding long paths in k-ary n-cubes with faulty nodes and links IEEE Trans. Parallel Distrib. Syst. 19 2008 1071 1085
    • (2008) IEEE Trans. Parallel Distrib. Syst. , vol.19 , pp. 1071-1085
    • Stewart, I.A.1    Xiang, Y.2
  • 25
    • 33745447235 scopus 로고    scopus 로고
    • Mapping cycles and trees on wrap-around butterfly graphs
    • M.D. Wagh, and O. Guzide Mapping cycles and trees on wrap-around butterfly graphs SIAM J. Comput. 35 2005 741 765
    • (2005) SIAM J. Comput. , vol.35 , pp. 741-765
    • Wagh, M.D.1    Guzide, O.2
  • 26
    • 33947311674 scopus 로고    scopus 로고
    • Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
    • M.-C. Yang, J.J.M. Tan, and L.-H. Hsu Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes J. Parallel Distrib. Comput. 67 2007 362 368
    • (2007) J. Parallel Distrib. Comput. , vol.67 , pp. 362-368
    • Yang, M.-C.1    Tan, J.J.M.2    Hsu, L.-H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.