Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Hon-Chan Chen"'
Autor:
Hon-Chan Chen
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 6, Iss 2 (2004)
Let G be a graph. A component of G is a maximal connected subgraph in G. A vertex v is a cut vertex of G if k(G-v) > k(G), where k(G) is the number of components in G. Similarly, an edge e is a bridge of G if k(G-e) > k(G). In this paper, we will pro
Externí odkaz:
https://doaj.org/article/fff2c02362864cb1a92ef0de2c8d15f5
Publikováno v:
The Computer Journal. 64:27-37
A graph $G=(V,E)$ is two-disjoint-cycle-cover $[r_1,r_2]$-pancyclic if for any integer $l$ satisfying $r_1 \leq l \leq r_2$, there exist two vertex-disjoint cycles $C_1$ and $C_2$ in $G$ such that the lengths of $C_1$ and $C_2$ are $l$ and $|V(G)| -
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70cd09123109bf2fb4a65bfec62f6693
https://doi.org/10.1093/comjnl/bxz134
https://doi.org/10.1093/comjnl/bxz134
Autor:
Hon-Chan Chen, Sui-Hua Yu
Publikováno v:
Innovation. 22:250-269
External sources of knowledge are widely believed to be essential in fostering innovation. However, empirical evidence on the relationship between externally acquired knowledge and organisational i...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e43751b70a3d46b4e0e169ef259ec5ee
https://doi.org/10.1080/14479338.2019.1642764
https://doi.org/10.1080/14479338.2019.1642764
Autor:
Hon-Chan Chen
Publikováno v:
Journal of Computers. :44-51
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81a647d284b08c3e62eda9a2163e67c3
https://doi.org/10.17706/jcp.14.1.44-51
https://doi.org/10.17706/jcp.14.1.44-51
Autor:
Hon-Chan Chen
Publikováno v:
IEICE Transactions on Information and Systems. :2902-2907
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03a2dc87831968b8335c2d8ea0e9c0fd
https://doi.org/10.1587/transinf.2018pap0006
https://doi.org/10.1587/transinf.2018pap0006
Autor:
Hon-Chan Chen, Tzu-Liang Kung
Publikováno v:
Applied Mathematics and Computation. 331:287-296
A graph G of k vertices is panconnected if for any two distinct vertices x and y, it has a path of length l joining x and y for any integer l satisfying d G ( x , y ) ≤ l ≤ k − 1 , where dG(x, y) denotes the distance between x and y in G. In pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cd1f6ccc4fb2793193ac2d892b43797
https://doi.org/10.1016/j.amc.2018.03.002
https://doi.org/10.1016/j.amc.2018.03.002
Autor:
Hon-Chan Chen
Publikováno v:
The Journal of Supercomputing. 74:2638-2655
In many parallel and distributed multiprocessor systems, the processors are connected based on different types of interconnection networks. The topological structure of an interconnection network is typically modeled as a graph. Among the many kinds
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33e6b6dbc29dee242ac61629c06b8288
https://doi.org/10.1007/s11227-018-2295-8
https://doi.org/10.1007/s11227-018-2295-8
Publikováno v:
Information Processing Letters. 121:34-38
In this note, we investigate the problem of embedding paths of various lengths into crossed cubes with faulty vertices. In Park et al. (2007) [14] showed that, for any hypercube-like interconnection network of 2 n vertices with a set F of faulty vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f48be47965d38c59e8f09b6075d02e10
https://doi.org/10.1016/j.ipl.2017.01.006
https://doi.org/10.1016/j.ipl.2017.01.006
Publikováno v:
The Computer Journal. 61:54-62
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a519313ea6d045b750932ca96861e4cd
https://doi.org/10.1093/comjnl/bxx034
https://doi.org/10.1093/comjnl/bxx034
Publikováno v:
ICCE-TW
In this paper, we consider the shortest problem in the coal transportation network of the thermal power plant. The assumed coal transportation network connects a dedicate ship uploaders for the power plant to each coal-fired generators. We analyze th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c58970f33b0a2513383eb554661678ab
https://doi.org/10.1109/icce-tw46550.2019.8992003
https://doi.org/10.1109/icce-tw46550.2019.8992003