Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Y-Chuang Chen"'
Publikováno v:
Journal of Supercomputing. Nov2010, Vol. 54 Issue 2, p229-238. 10p. 6 Diagrams.
Autor:
Tsung-Han Tsai, Y-Chuang Chen
Publikováno v:
Information Processing Letters. 116:585-589
GRC graphs have more flexible structures than recursive circulant graphs.We construct edge-disjoint Hamiltonian cycles of GRC graphs.We prove that some of the GRC graphs are Hamiltonian decomposable. In 2012, Tang et al. 9 proposed a new class of gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d843ed22b1ebf5ad647bc9d4aaa36b77
https://doi.org/10.1016/j.ipl.2016.04.003
https://doi.org/10.1016/j.ipl.2016.04.003
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 27:250-262
Topological properties have become a popular and important area of focus for studies that analyze interconnections between networks. The hypercube is one of the most widely discussed topological structures for interconnections between networks and is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5ccf20c133979c0919177172fdcb0e8
https://doi.org/10.1109/tpds.2014.2387284
https://doi.org/10.1109/tpds.2014.2387284
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 25:3317-3327
The n-dimensional hypercube is one of the most popular topological structure for interconnection networks in parallel computing and communication systems. The exchanged hypercube EH(s, t), a variant of the hypercube, retains several valuable and desi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d18afd72b1c44d0be4ca319aacdf099c
https://doi.org/10.1109/tpds.2014.2307853
https://doi.org/10.1109/tpds.2014.2307853
Publikováno v:
Information Sciences. 273:387-392
The connectivity of a graph is an important issue in graph theory, and is also one of the most important factors in evaluating the reliability and fault tolerance of a network. It is known that the augmented cube AQ n is maximally connected, i.e. ( 2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a109bb65372429e3748f8e929e14137f
https://doi.org/10.1016/j.ins.2014.03.022
https://doi.org/10.1016/j.ins.2014.03.022
Autor:
Y-Chuang Chen
Publikováno v:
Applied Mathematics and Computation. 217:8489-8494
Super connectivity is an important issue in interconnection networks. It has been shown that if a network possesses the super connectivity property, it has a high reliability and a small vertex failure rate. Many interconnection networks, like the hy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc8be4875e749c41139e671797ec550e
https://doi.org/10.1016/j.amc.2011.03.051
https://doi.org/10.1016/j.amc.2011.03.051
Publikováno v:
The Journal of Supercomputing. 54:229-238
Processor (vertex) faults and link (edge) faults may happen when a network is used, and it is meaningful to consider networks (graphs) with faulty processors and/or links. A k-regular Hamiltonian and Hamiltonian connected graph G is optimal fault-tol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79bf332a86469ecf49e48c2931d7f46b
https://doi.org/10.1007/s11227-009-0316-3
https://doi.org/10.1007/s11227-009-0316-3
Autor:
Jimmy J. M. Tan, Y-Chuang Chen
Publikováno v:
Applied Mathematics and Computation. 188:1848-1855
Vertex connectivity and edge connectivity are two important parameters in interconnection networks. Even though they reflect the fault tolerance correctly, they undervalue the resilience of large networks. By the concept of conditional connectivity a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac9f51339136f9cd126b6a89fa5934f2
https://doi.org/10.1016/j.amc.2006.11.085
https://doi.org/10.1016/j.amc.2006.11.085
Publikováno v:
Applied Mathematics and Computation. 177:465-481
For the interconnection network topology, it is usually represented by a graph. When a network is used, processors and/or links faults may happen. Thus, it is meaningful to consider faulty networks. We consider k -regular graphs in this paper. We def
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09bff4cf197ba8b438a76aa05d268708
https://doi.org/10.1016/j.amc.2005.11.023
https://doi.org/10.1016/j.amc.2005.11.023
Publikováno v:
Applied Mathematics and Computation. 148:729-741
A k-regular Hamiltonian and Hamiltonian connected graph G is super fault-tolerant Hamiltonian if G remains Hamiltonian after removing at most k-2 nodes and/or edges and remains Hamiltonian connected after removing at most k-3 nodes and/or edges. A su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43bd081e7975b3d44bd2658d9ef1182d
https://doi.org/10.1016/s0096-3003(02)00933-5
https://doi.org/10.1016/s0096-3003(02)00933-5