메뉴 건너뛰기




Volumn 180, Issue 13, 2010, Pages 2596-2617

Conditional edge-fault Hamiltonicity of augmented cubes

Author keywords

Augmented cubes; Fault tolerant embedding; Graph theoretic interconnection networks; Hamiltonian cycles; Hamiltonicity

Indexed keywords

AUGMENTED CUBES; FAULT-TOLERANT EMBEDDING; GRAPH-THEORETIC INTERCONNECTION NETWORKS; HAMILTONIAN CYCLE; HAMILTONICITY;

EID: 77950864654     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2010.03.005     Document Type: Article
Times cited : (50)

References (45)
  • 1
    • 34250833453 scopus 로고
    • A group-theoretic model for symmetric interconnection networks
    • Akers S.B., and Krishnamurthy B. A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers 38 4 (1989) 555-566
    • (1989) IEEE Transactions on Computers , vol.38 , Issue.4 , pp. 555-566
    • Akers, S.B.1    Krishnamurthy, B.2
  • 3
    • 34147133212 scopus 로고    scopus 로고
    • Hamiltonian laceability of bubble-sort graphs with edge faults
    • Araki T., and Kikuchi Y. Hamiltonian laceability of bubble-sort graphs with edge faults. Information Sciences 177 13 (2007) 2679-2691
    • (2007) Information Sciences , vol.177 , Issue.13 , pp. 2679-2691
    • Araki, T.1    Kikuchi, Y.2
  • 5
    • 0021411652 scopus 로고
    • Generalized hypercubes and hyperbus structure for a computer network
    • Bhuyan L., and Agrawal D.P. Generalized hypercubes and hyperbus structure for a computer network. IEEE Transactions on Computers C-33 (1984) 323-333
    • (1984) IEEE Transactions on Computers , vol.C-33 , pp. 323-333
    • Bhuyan, L.1    Agrawal, D.P.2
  • 6
    • 67649770234 scopus 로고    scopus 로고
    • Many-to-many disjoint paths in faulty hypercubes
    • Chen X.B. Many-to-many disjoint paths in faulty hypercubes. Information Sciences 179 18 (2009) 3110-3115
    • (2009) Information Sciences , vol.179 , Issue.18 , pp. 3110-3115
    • Chen, X.B.1
  • 7
    • 0141764686 scopus 로고    scopus 로고
    • Augmented cubes
    • Choudum S.A., and Sunitha V. Augmented cubes. Networks 40 2 (2002) 71-84
    • (2002) Networks , vol.40 , Issue.2 , pp. 71-84
    • Choudum, S.A.1    Sunitha, V.2
  • 9
    • 70350571716 scopus 로고    scopus 로고
    • Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
    • Dong Q., Yang X., and Wang D. Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links. Information Sciences 180 1 (2010) 198-208
    • (2010) Information Sciences , vol.180 , Issue.1 , pp. 198-208
    • Dong, Q.1    Yang, X.2    Wang, D.3
  • 10
    • 68349130361 scopus 로고    scopus 로고
    • Long paths in hypercubes with a quadratic number of faults
    • Dvořák T., and Koubek V. Long paths in hypercubes with a quadratic number of faults. Information Sciences 179 21 (2009) 3763-3771
    • (2009) Information Sciences , vol.179 , Issue.21 , pp. 3763-3771
    • Dvořák, T.1    Koubek, V.2
  • 12
    • 67849126512 scopus 로고    scopus 로고
    • Long paths and cycles in hypercubes with faulty vertices
    • Fink J., and Gregor P. Long paths and cycles in hypercubes with faulty vertices. Information Sciences 179 20 (2009) 3634-3644
    • (2009) Information Sciences , vol.179 , Issue.20 , pp. 3634-3644
    • Fink, J.1    Gregor, P.2
  • 13
    • 0038147168 scopus 로고    scopus 로고
    • Fault-tolerant cycle embedding in the hypercube
    • Fu J.S. Fault-tolerant cycle embedding in the hypercube. Parallel computing 29 6 (2003) 821-832
    • (2003) Parallel computing , vol.29 , Issue.6 , pp. 821-832
    • Fu, J.S.1
  • 14
    • 34447544022 scopus 로고    scopus 로고
    • Conditional fault-tolerant Hamiltonicity of star graphs
    • Fu J.S. Conditional fault-tolerant Hamiltonicity of star graphs. Parallel Computing 33 7-8 (2007) 488-496
    • (2007) Parallel Computing , vol.33 , Issue.7-8 , pp. 488-496
    • Fu, J.S.1
  • 15
    • 53249103166 scopus 로고    scopus 로고
    • Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
    • Fu J.S. Fault-free Hamiltonian cycles in twisted cubes with conditional link faults. Theoretical Computer Science 407 1-3 (2008) 318-329
    • (2008) Theoretical Computer Science , vol.407 , Issue.1-3 , pp. 318-329
    • Fu, J.S.1
  • 16
    • 41949139547 scopus 로고    scopus 로고
    • Hamiltonian connectivity of the WK-recursive network with faulty nodes
    • Fu J.S. Hamiltonian connectivity of the WK-recursive network with faulty nodes. Information Sciences 178 12 (2008) 2573-2584
    • (2008) Information Sciences , vol.178 , Issue.12 , pp. 2573-2584
    • Fu, J.S.1
  • 17
    • 84875993364 scopus 로고
    • The twisted cube
    • Proceedings of the Conference on Parallel Architectures and Languages Europe, Parallel Architectures, 258
    • P.A.J. Hilbers, M.R.J. Koopman, J.L.A. van de Snepscheut, The twisted cube, in: Proceedings of the Conference on Parallel Architectures and Languages Europe, Parallel Architectures, Lecture Notes in Computer Science, vol. I, 258, 1987, pp. 152-159.
    • (1987) Lecture Notes in Computer Science , vol.1 , pp. 152-159
    • Hilbers, P.A.J.1    Koopman, M.R.J.2    van de Snepscheut, J.L.A.3
  • 19
    • 0034921974 scopus 로고    scopus 로고
    • Longest fault-free paths in star graphs with vertex faults
    • Hsieh S.Y., Chen G.H., and Ho C.W. Longest fault-free paths in star graphs with vertex faults. Theoretical Computer Science 262 1-2 (2001) 215-227
    • (2001) Theoretical Computer Science , vol.262 , Issue.1-2 , pp. 215-227
    • Hsieh, S.Y.1    Chen, G.H.2    Ho, C.W.3
  • 20
    • 0035440302 scopus 로고    scopus 로고
    • Longest fault-free paths in star graphs with edge faults
    • Hsieh S.Y., Chen G.H., and Ho C.W. Longest fault-free paths in star graphs with edge faults. IEEE Transactions on Computers 50 9 (2001) 960-971
    • (2001) IEEE Transactions on Computers , vol.50 , Issue.9 , pp. 960-971
    • Hsieh, S.Y.1    Chen, G.H.2    Ho, C.W.3
  • 21
    • 18444372047 scopus 로고    scopus 로고
    • Embedding longest fault-free paths onto star graphs with more vertex faults
    • Hsieh S.Y. Embedding longest fault-free paths onto star graphs with more vertex faults. Theoretical Computer Science 337 1-3 (2005) 370-378
    • (2005) Theoretical Computer Science , vol.337 , Issue.1-3 , pp. 370-378
    • Hsieh, S.Y.1
  • 22
    • 29244488249 scopus 로고    scopus 로고
    • Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges
    • Hsieh S.Y. Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges. Parallel Computing 32 1 (2006) 84-91
    • (2006) Parallel Computing , vol.32 , Issue.1 , pp. 84-91
    • Hsieh, S.Y.1
  • 24
  • 25
    • 77950806778 scopus 로고    scopus 로고
    • Pancyclicity of restricted hypercube-like networks under the conditional fault model
    • Hsieh S.Y., and Lee C.W. Pancyclicity of restricted hypercube-like networks under the conditional fault model. SIAM Journal on Discrete Mathematics 23 1 (2010) 2010-2019
    • (2010) SIAM Journal on Discrete Mathematics , vol.23 , Issue.1 , pp. 2010-2019
    • Hsieh, S.Y.1    Lee, C.W.2
  • 26
    • 0039068310 scopus 로고
    • Interconnection networks and algorithms
    • (special issue)
    • Hsu D.F. Interconnection networks and algorithms. Networks 23 4 (1993) (special issue)
    • (1993) Networks , vol.23 , Issue.4
    • Hsu, D.F.1
  • 28
    • 34648846050 scopus 로고    scopus 로고
    • Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
    • Hung H.S., Chen G.H., and Fu J.S. Fault-free Hamiltonian cycles in crossed cubes with conditional link faults. Information Sciences 177 24 (2007) 5664-5674
    • (2007) Information Sciences , vol.177 , Issue.24 , pp. 5664-5674
    • Hung, H.S.1    Chen, G.H.2    Fu, J.S.3
  • 29
    • 57649240422 scopus 로고    scopus 로고
    • Long paths in hypercubes with conditional node-faults
    • Kueng T.L., Liang T., Hsu L.H., and Tan J.J.M. Long paths in hypercubes with conditional node-faults. Information Sciences 179 5 (2009) 667-681
    • (2009) Information Sciences , vol.179 , Issue.5 , pp. 667-681
    • Kueng, T.L.1    Liang, T.2    Hsu, L.H.3    Tan, J.J.M.4
  • 30
    • 67349114903 scopus 로고    scopus 로고
    • Constructing the nearly shortest path in crossed cubes
    • Lai P.L., and Hsu H.C. Constructing the nearly shortest path in crossed cubes. Information Sciences 179 14 (2009) 2487-2493
    • (2009) Information Sciences , vol.179 , Issue.14 , pp. 2487-2493
    • Lai, P.L.1    Hsu, H.C.2
  • 32
    • 33847166235 scopus 로고    scopus 로고
    • Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
    • Ma M., Liu G., and Xu J.M. Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes. Parallel Computing 33 1 (2007) 36-42
    • (2007) Parallel Computing , vol.33 , Issue.1 , pp. 36-42
    • Ma, M.1    Liu, G.2    Xu, J.M.3
  • 34
    • 33746312460 scopus 로고    scopus 로고
    • J.H. Park, H.C. Kim, H.S. Lim, Fault-Hamiltonicity of hypercube-like interconnection networks, in: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium, 2005 (IPDPS'05), 1, 2005, pp. 60.1.
    • J.H. Park, H.C. Kim, H.S. Lim, Fault-Hamiltonicity of hypercube-like interconnection networks, in: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium, 2005 (IPDPS'05), vol. 1, 2005, pp. 60.1.
  • 36
    • 1642633000 scopus 로고    scopus 로고
    • Linear array and ring embeddings in conditional faulty hypercubes
    • Tsai C.H. Linear array and ring embeddings in conditional faulty hypercubes. Theoretical Computer Science 314 (2004) 431-443
    • (2004) Theoretical Computer Science , vol.314 , pp. 431-443
    • Tsai, C.H.1
  • 37
    • 58049087668 scopus 로고    scopus 로고
    • Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
    • Tsai P.Y., Fu J.S., and Chen G.H. Embedding Hamiltonian cycles in alternating group graphs under conditional fault model. Information Sciences 179 6 (2009) 851-857
    • (2009) Information Sciences , vol.179 , Issue.6 , pp. 851-857
    • Tsai, P.Y.1    Fu, J.S.2    Chen, G.H.3
  • 39
    • 0036930547 scopus 로고    scopus 로고
    • A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks
    • Wang N.C., Chu C.P., and Chen T.S. A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks. Journal of Parallel and Distributed Computing 62 12 (2002) 1747-1762
    • (2002) Journal of Parallel and Distributed Computing , vol.62 , Issue.12 , pp. 1747-1762
    • Wang, N.C.1    Chu, C.P.2    Chen, T.S.3
  • 40
    • 70350570547 scopus 로고    scopus 로고
    • Path embeddings in faulty 3-ary n-cubes
    • Wang S., and Lin S. Path embeddings in faulty 3-ary n-cubes. Information Sciences 180 1 (2010) 191-197
    • (2010) Information Sciences , vol.180 , Issue.1 , pp. 191-197
    • Wang, S.1    Lin, S.2
  • 42
    • 13844299270 scopus 로고    scopus 로고
    • Multicast communication in wormhole-routed symmetric networks with Hamiltonian cycle model
    • Wang N.C., Yen C.P., and Chu C.P. Multicast communication in wormhole-routed symmetric networks with Hamiltonian cycle model. Journal of Systems Architecture 51 3 (2005) 165-183
    • (2005) Journal of Systems Architecture , vol.51 , Issue.3 , pp. 165-183
    • Wang, N.C.1    Yen, C.P.2    Chu, C.P.3
  • 43
    • 34447345131 scopus 로고    scopus 로고
    • Node-disjoint paths in hierarchical hypercube network
    • Wu R.Y., Chen G.H., Kuo Y.L., and Chang G.J. Node-disjoint paths in hierarchical hypercube network. Information Sciences 177 19 (2007) 4200-4207
    • (2007) Information Sciences , vol.177 , Issue.19 , pp. 4200-4207
    • Wu, R.Y.1    Chen, G.H.2    Kuo, Y.L.3    Chang, G.J.4
  • 44
    • 0028436811 scopus 로고
    • Embedding of rings and meshes onto faulty hypercubes using free dimensions
    • Yang P.J., Tien S.B., and Raghavendra C.S. Embedding of rings and meshes onto faulty hypercubes using free dimensions. IEEE Transactions on Computers 43 5 (1994) 608-613
    • (1994) IEEE Transactions on Computers , vol.43 , Issue.5 , pp. 608-613
    • Yang, P.J.1    Tien, S.B.2    Raghavendra, C.S.3


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