Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Meirun Chen"'
Autor:
Meirun Chen, Cheng-Kuan Lin
Publikováno v:
Mathematics, Vol 11, Iss 12, p 2615 (2023)
Motivated by two typical ways to construct multiprocessor systems, matching composition networks and cycle composition networks, we generalize the definition of the Cartesian product of networks and consider the classical diagnosability of the genera
Externí odkaz:
https://doaj.org/article/0147192f15ea49d78006c6eb80cf151a
Publikováno v:
Journal of Applied Mathematics, Vol 2014 (2014)
This paper mainly focuses on routing in two-dimensional mesh networks. We propose a novel faulty block model, which is cracky rectangular block, for fault-tolerant adaptive routing. All the faulty nodes and faulty links are surrounded in this type of
Externí odkaz:
https://doaj.org/article/006d43c13492419b9f277e48f0188d09
Publikováno v:
The Journal of Supercomputing. 79:7584-7608
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f36562527b843beecd7a406d404418a
https://doi.org/10.1007/s11227-022-04949-8
https://doi.org/10.1007/s11227-022-04949-8
Publikováno v:
Theoretical Computer Science. 934:81-90
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb76c6735fd0eab45efa8229772fe643
https://doi.org/10.1016/j.tcs.2022.08.020
https://doi.org/10.1016/j.tcs.2022.08.020
Publikováno v:
Journal of Information Science & Engineering; Mar2024, Vol. 40 Issue 2, p231-244, 14p
Autor:
Lin, Meirun Chen, Cheng-Kuan
Publikováno v:
Mathematics; Volume 11; Issue 12; Pages: 2615
Motivated by two typical ways to construct multiprocessor systems, matching composition networks and cycle composition networks, we generalize the definition of the Cartesian product of networks and consider the classical diagnosability of the genera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::ec732ebae4b0f81f59d48ebc2f3e2990
Publikováno v:
Theoretical Computer Science. 922:361-367
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f391bb529b502a9752d0c1ba3ed76b1
https://doi.org/10.1016/j.tcs.2022.04.036
https://doi.org/10.1016/j.tcs.2022.04.036
Publikováno v:
Communications in Computer and Information Science ISBN: 9789811995811
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31bb6a552c8173b8e99181150fc180b6
https://doi.org/10.1007/978-981-19-9582-8_5
https://doi.org/10.1007/978-981-19-9582-8_5
Autor:
Meirun Chen, Naidan Ji
Publikováno v:
Graphs and Combinatorics. 34:1295-1314
For an edge e of a given graph G, define $$c_e(G)$$ be the length of a longest cycle of G containing e. Wang and Lv (2008) gave a tight function $$f_{0}(n,k)$$ (for integers $$n\ge 3$$ and $$k\ge 4$$ ), such that for any 2-connected graph G on n vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10fd6fa90ee3cbfb65710e69c4322ad5
https://doi.org/10.1007/s00373-018-1950-4
https://doi.org/10.1007/s00373-018-1950-4
Autor:
Reza Naserasr, Meirun Chen
Publikováno v:
Information Processing Letters
Information Processing Letters, Elsevier, 2018
Information Processing Letters, Elsevier, 2018
A routing in a graph G is a set of paths connecting each ordered pair of vertices. Load of an edge e is the number of times it appears on these paths. The edge-forwarding index of G is the smallest of maximum loads over all routings. Augmented cube o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af6a2d2ac7dc09c7c60b57a4fb9f353e
https://hal.archives-ouvertes.fr/hal-01934333/file/OptimalRoutingAugmentedCubesRevised18Feb2018.pdf
https://hal.archives-ouvertes.fr/hal-01934333/file/OptimalRoutingAugmentedCubesRevised18Feb2018.pdf