default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCheng-Kuan Lin
- > Home > Persons > Cheng-Kuan Lin
Publications
- 2024
[j111]Yali Lv
, Cheng-Kuan Lin, D. Frank Hsu, Jianxi Fan:
An algorithm for conditional-fault local diagnosis of multiprocessor systems under the MM⁎ model. Theor. Comput. Sci. 987: 114372 (2024)- 2022
- [c30]Yali Lv, Cheng-Kuan Lin, D. Frank Hsu, Jianxi Fan:
A Comparison Diagnosis Algorithm for Conditional Fault Local Diagnosis of Multiprocessor Systems. ICS 2022: 123-134 - 2021
- [j99]Xiaoyan Li, Cheng-Kuan Lin, Jianxi Fan, Xiaohua Jia, Baolei Cheng, Jingya Zhou:
Relationship Between Extra Connectivity And Component Connectivity In Networks. Comput. J. 64(1): 38-53 (2021) - [j94]Lili Zhang, Cheng-Kuan Lin, Xiaoqiang Chen, Jianxi Fan, Yuan-Hsiang Teng:
Efficient algorithms for support path with time constraint. J. Comb. Optim. 42(1): 187-205 (2021) - 2020
- [j88]Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Yan Wang, Guijuan Wang:
An improved algorithm to construct edge-independent spanning trees in augmented cubes. Discret. Appl. Math. 277: 55-70 (2020) - [j87]Cheng-Kuan Lin, Liang Ma, Jianxi Fan, Lih-Hsing Hsu, Yuan-Hsiang Teng:
The Conditional-(g, d, k)-Connectivity and Conditional-(g, d, k)-edge-Connectivity on the Hypercubes. Fundam. Informaticae 173(1): 33-45 (2020) - [j86]Baolei Cheng, Jianxi Fan, Qiang Lyu, Cheng-Kuan Lin, Xiaoyan Li, Guo Chen:
Constructing Node-Independent Spanning Trees in Augmented Cubes. Fundam. Informaticae 176(2): 103-128 (2020) - [j84]Yuejuan Han, Lantao You, Cheng-Kuan Lin, Jianxi Fan:
Communication Performance Evaluation of the Locally Twisted Cube. Int. J. Found. Comput. Sci. 31(2): 233-252 (2020) - [j83]Guijuan Wang, Cheng-Kuan Lin, Jianxi Fan, Jingya Zhou, Baolei Cheng:
Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements. J. Comput. Sci. Technol. 35(5): 1064-1083 (2020) - [j82]Ningning Liu, Jianxi Fan, Chengkuan Lin:
基于地址空间的树型网络地址分配 (Address Assignment Algorithm for Tree Network Based on Address Space). 计算机科学 47(2): 239-244 (2020) - [j80]Xiaoyan Li, Xiaohua Jia, Jianxi Fan, Cheng-Kuan Lin:
Reliability analysis of data center networks based on precise and imprecise diagnosis strategies. Theor. Comput. Sci. 809: 189-203 (2020) - [j78]Guijuan Wang, Cheng-Kuan Lin, Jianxi Fan, Baolei Cheng, Xiaohua Jia:
A Novel Low Cost Interconnection Architecture Based on the Generalized Hypercube. IEEE Trans. Parallel Distributed Syst. 31(3): 647-662 (2020) - 2019
- [j76]Guijuan Wang, Cheng-Kuan Lin, Baolei Cheng, Jianxi Fan, Weibei Fan:
Structure Fault-Tolerance of the Generalized Hypercube. Comput. J. 62(10): 1463-1476 (2019) - [j74]Jingya Zhou, Jianxi Fan, Cheng-Kuan Lin, Baolei Cheng:
A Cost-Efficient Approach to Storing Users' Data for Online Social Networks. J. Comput. Sci. Technol. 34(1): 234-252 (2019) - [j73]Weibei Fan, Jianxi Fan, Cheng-Kuan Lin, Yan Wang, Yuejuan Han, Ruchuan Wang:
Optimally Embedding 3-Ary n-Cubes into Grids. J. Comput. Sci. Technol. 34(2): 372-387 (2019) - [j72]Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia, Xiaoyan Li:
Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme. J. Parallel Distributed Comput. 134: 104-115 (2019) - [j71]Xiaoyan Li, Jianxi Fan, Cheng-Kuan Lin, Baolei Cheng, Xiaohua Jia:
The extra connectivity, extra conditional diagnosability and t/k-diagnosability of the data center network DCell. Theor. Comput. Sci. 766: 16-29 (2019) - [j70]Weibei Fan, Jianxi Fan, Cheng-Kuan Lin, Guijuan Wang, Baolei Cheng, Ruchuan Wang:
An efficient algorithm for embedding exchanged hypercubes into grids. J. Supercomput. 75(2): 783-807 (2019) - [c24]Guijuan Wang, Cheng-Kuan Lin, Jianxi Fan, Baolei Cheng, Zhao Liu:
Vertex-Disjoint Paths in the Generalized Hypercube under 1-Restricted Connectivity. HPCC/SmartCity/DSS 2019: 1491-1498 - 2018
- [j69]Xiaoyan Li, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia:
Diagnosability Evaluation of the Data Center Network DCell. Comput. J. 61(1): 129-143 (2018) - [j68]Yali Lv, Jianxi Fan, D. Frank Hsu, Cheng-Kuan Lin:
Structure connectivity and substructure connectivity of k-ary n-cube networks. Inf. Sci. 433-434: 115-124 (2018) - [j67]Xi Wang, Jianxi Fan, Cheng-Kuan Lin, Jingya Zhou, Zhao Liu:
BCDC: A High-Performance, Server-Centric Data Center Network. J. Comput. Sci. Technol. 33(2): 400-416 (2018) - [j66]Yali Lv, Cheng-Kuan Lin, Jianxi Fan, Xiaohua Jia:
Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K1, 3-structure faults. J. Parallel Distributed Comput. 120: 148-158 (2018) - [c23]Weibei Fan, Jianxi Fan, Cheng-Kuan Lin, Zhijie Han, Peng Li, Ruchuan Wang:
Embedding Exchanged Hypercubes into Rings and Ladders. ICA3PP (2) 2018: 3-17 - 2017
- [j65]Yali Lv, Cheng-Kuan Lin, Jianxi Fan:
Hamiltonian Cycle and Path Embeddings in k-Ary n-Cubes Based on Structure Faults. Comput. J. 60(2): 159-179 (2017) - [j63]Dongfang Zhou, Jianxi Fan, Cheng-Kuan Lin, Jingya Zhou, Xi Wang:
Cycles Embedding in Exchanged Crossed Cube. Int. J. Found. Comput. Sci. 28(1): 61-76 (2017) - [j62]Lili Guo, Xi Wang, Cheng-Kuan Lin, Jingya Zhou, Jianxi Fan:
A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices. Int. J. Found. Comput. Sci. 28(7): 915-930 (2017) - [j60]Dongfang Zhou, Jianxi Fan, Cheng-Kuan Lin, Baolei Cheng, Jingya Zhou, Zhao Liu:
Optimal Path Embedding in the Exchanged Crossed Cube. J. Comput. Sci. Technol. 32(3): 618-629 (2017) - [j59]Cheng-Kuan Lin, Yuan Zhao, Jianxi Fan, Baolei Cheng:
基于顶点度数的完全独立生成树研究 (Research on Completely Independent Spanning Trees Based on Degree of Vertices). 计算机科学 44(6): 94-96 (2017) - 2016
- [j56]Xi Wang, Jianxi Fan, Jingya Zhou, Cheng-Kuan Lin:
The restricted h-connectivity of the data center network DCell. Discret. Appl. Math. 203: 144-157 (2016) - [j54]Xi Wang, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia:
Vertex-disjoint paths in DCell networks. J. Parallel Distributed Comput. 96: 38-44 (2016) - [j53]Xi Wang, Jianxi Fan, Xiaohua Jia, Cheng-Kuan Lin:
An efficient algorithm to construct disjoint path covers of DCell networks. Theor. Comput. Sci. 609: 197-210 (2016) - [j52]Cheng-Kuan Lin, Lili Zhang, Jianxi Fan, Dajin Wang:
Structure connectivity and substructure connectivity of hypercubes. Theor. Comput. Sci. 634: 97-107 (2016) - [c19]Lili Zhang, Xiaoqiang Chen, Jianxi Fan, Cheng-Kuan Lin:
Support path with time constraint in wireless sensor networks. APNOMS 2016: 1-4 - [c17]Yali Lv, Cheng-Kuan Lin, Jianxi Fan:
Hamiltonian Cycle and Path Embeddings in 3-Ary n-Cubes Based on K1, 2-Structure Faults. Trustcom/BigDataSE/ISPA 2016: 1226-1232 - 2015
- [c16]Manyi Du, Jianxi Fan, Yuejuan Han, Cheng-Kuan Lin:
One-to-One Disjoint Path Covers on Mesh. ICA3PP (2) 2015: 420-433 - [c15]Zhao Liu, Jianxi Fan, Cheng-Kuan Lin, Baolei Cheng, Jingya Zhou:
Dynamic Reconfiguration of Complete Binary Trees in Faulty Locally Twisted Cubes. MSN 2015: 243-249 - [c14]Lili Zhang, Xiaoqiang Chen, Jianxi Fan, Dajin Wang, Cheng-Kuan Lin:
The Minimal Exposure Path in Mobile Wireless Sensor Network. PAAP 2015: 73-79 - 2014
- [c13]Liang Ma, Jianxi Fan, Lih-Hsing Hsu, Cheng-Kuan Lin:
Conditional Connectivity with Distance Requirement on Hypercube. CSE 2014: 1277-1281 - [c12]Yan Chu, Jianxi Fan, Wenjun Liu, Cheng-Kuan Lin:
PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs. ICA3PP (1) 2014: 114-126 - [c10]Haifei Shen, Jianxi Fan, Baolei Cheng, Cheng-Kuan Lin:
A model based on crossed cubes for VoD services. ICSAI 2014: 659-664
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
