default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChun-Nan Hung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j22]Cheng-Kuan Lin, Tzu-Liang Kung, Chun-Nan Hung, Yuan-Hsiang Teng:
A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model. Fundam. Informaticae 185(4): 357-373 (2022)- 2021
- [j21]Mohamad Abdallah
, Chun-Nan Hung:
Neighbor Connectivity of the Alternating Group Graph. J. Interconnect. Networks 21(3): 2150014:1-2150014:10 (2021) - [c13]Tzu-Liang Kung, Cheng-Kuan Lin, Chun-Nan Hung:
On the Neighborhood-Connectivity of Locally Twisted Cube Networks. IMIS 2021: 314-321 - [i1]Cheng-Kuan Lin, Tzu-Liang Kung, Chun-Nan Hung, Yuan-Hsiang Teng:
A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model. CoRR abs/2107.05455 (2021) - 2020
- [j20]Eddie Cheng, Lih-Hsing Hsu, Chun-Nan Hung, Meng-Chien Yang:
2-spanning cyclability problems of the some generalized Petersen graphs. Discuss. Math. Graph Theory 40(3): 713-731 (2020) - [j19]Chun-Nan Hung, Mohamad Abdallah, Jui-I Weng, Tzu-Liang Kung:
Edge-pancyclicity of pancake graph. Int. J. Comput. Math. Comput. Syst. Theory 5(3): 125-133 (2020)
2010 – 2019
- 2019
- [c12]Tzu-Liang Kung, Chun-Nan Hung:
Combinatorial analytics on the localized subcube reliability of hypercube networks*. SNPD 2019: 72-77 - [c11]Chun-Nan Hung, Tzu-Liang Kung, Yuan-Hsiang Teng, Jui-I Weng, TsuiChi Chang:
The Cycles Embedding in Pancake Networks. SNPD 2019: 84-87 - 2018
- [j18]Chun-Nan Hung, Tao-Ming Wang, Lih-Hsing Hsu, Eddie Cheng:
Fault-Hamiltonicity of Cartesian products of directed cycles. Art Discret. Appl. Math. 1(1): #P1.06 (2018) - [c10]Tzu-Liang Kung, Chun-Nan Hung, Yuan-Hsiang Teng:
On the Channel Congestion of the Shortest-Path Routing for Unidirectional Hypercube Networks. IMIS 2018: 610-619 - [c9]Chun-Nan Hung, Tzu-Liang Kung, En-Cheng Zhang:
Construction Schemes for Edge Fault-Tolerance of Ring Networks. IMIS 2018: 626-631 - 2017
- [j17]Chun-Nan Hung, Cheng-Kuan Lin, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions. Parallel Process. Lett. 27(2): 1750005:1-1750005:25 (2017) - [j16]Tzu-Liang Kung, Chun-Nan Hung:
Estimating the subsystem reliability of bubblesort networks. Theor. Comput. Sci. 670: 45-55 (2017) - [c8]Tzu-Liang Kung, Chun-Nan Hung:
Accurate Reliability Estimation Based on the Collection of First-Order Subsystems in the Bubblesort Network. ACIT/CSII/BCD 2017: 95-100 - [c7]Chun-Nan Hung, Tzu-Liang Kung, Lih-Hsing Hsu, Kevin Chen, Shi Zhe Lai:
The Arcs Fault-Tolerance for 4-Pancyclic Properties of Unidirectional Hypercubes. ACIT/CSII/BCD 2017: 115-118 - 2016
- [c6]Tzu-Liang Kung, Chun-Nan Hung, Yuan-Hsiang Teng, Jui-Yu Hung, Lih-Hsing Hsu:
On the Robust Approach to Data Inconsistency Detection of Sensor Networks. IMIS 2016: 425-429 - [c5]Tzu-Liang Kung, Chun-Nan Hung, Cheng-Kuan Lin, Hsiang-Chun Chen, Chia-Hui Lin, Lih-Hsing Hsu:
A Framework of Cycle-Based Clustering on the Crossed Cube Architecture. IMIS 2016: 430-434 - 2015
- [j15]Chun-Nan Hung, Eddie Cheng, Tao-Ming Wang, Lih-Hsing Hsu:
On Hamiltonian properties of unidirectional hypercubes. Inf. Process. Lett. 115(6-8): 551-555 (2015) - 2013
- [j14]Chun-Nan Hung, David Lu, Randy Jia, Cheng-Kuan Lin, László Lipták, Eddie Cheng, Jimmy J. M. Tan, Lih-Hsing Hsu:
4-ordered-Hamiltonian problems of the generalized Petersen graph GP(n, 4). Math. Comput. Model. 57(3-4): 595-601 (2013) - 2011
- [c4]Lih-Hsing Hsu, Cheng-Kuan Lin, Jimmy J. M. Tan, Chun-Nan Hung:
Embedding Cycles into Hypercubes with Prescribe Vertices in the Specific Order. CSE 2011: 351-357
2000 – 2009
- 2007
- [j13]Tung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu:
On cubic 2-independent Hamiltonian connected graphs. J. Comb. Optim. 14(2-3): 275-294 (2007) - [j12]Chao-Ming Sun, Chun-Nan Hung, Hua-Min Huang, Lih-Hsing Hsu, Yue-Dar Jou:
Hamiltonian laceability of Faulty Hypercubes. J. Interconnect. Networks 8(2): 133-145 (2007) - 2006
- [c3]Chun-Nan Hung, Yi-Hua Chang, Chao-Ming Sun:
Longest Paths and Cycles in Faulty Hypercubes. Parallel and Distributed Computing and Networks 2006: 101-110 - 2003
- [j11]Chun-Nan Hung, Hong-Chun Hsu, Kao-Yung Liang, Lih-Hsing Hsu:
Ring embedding in faulty pancake graphs. Inf. Process. Lett. 86(5): 271-275 (2003) - 2002
- [j10]Wen-Tzeng Huang, Jimmy J. M. Tan, Chun-Nan Hung, Lih-Hsing Hsu:
Fault-Tolerant Hamiltonicity of Twisted Cubes. J. Parallel Distributed Comput. 62(4): 591-604 (2002) - [c2]Chun-Nan Hung, Kao-Yung Liang, Lih-Hsing Hsu:
Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs. ISPAN 2002: 179-184 - 2001
- [j9]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
On the construction of combined k-fault-tolerant Hamiltonian graphs. Networks 37(3): 165-170 (2001) - 2000
- [j8]Jeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
Construction schemes for fault-tolerant Hamiltonian graphs. Networks 35(3): 233-245 (2000) - [j7]Chun-Nan Hung, Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu:
On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks. IEEE Trans. Parallel Distributed Syst. 11(8): 864 (2000)
1990 – 1999
- 1999
- [j6]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings. Inf. Process. Lett. 72(1-2): 55-63 (1999) - [j5]Chang-Hsiung Tsai, Chun-Nan Hung, Lih-Hsing Hsu, Chung-Haw Chang:
The correct diameter of trivalent Cayley graphs. Inf. Process. Lett. 72(3-4): 109-111 (1999) - 1998
- [j4]Jeng-Jung Wang, Chun-Nan Hung, Lih-Hsing Hsu:
Optimal 1-Hamiltonian Graphs. Inf. Process. Lett. 65(3): 157-161 (1998) - [c1]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
Christmas Tree: A 1-Fault-Tolerant Network for Token Rings. ICPADS 1998: 383- - 1996
- [j3]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
A response to Volgenant's Addendum on the most vital edges. Networks 27(4): 255 (1996) - 1993
- [j2]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
The most vital edges of matching in a bipartite graph. Networks 23(4): 309-313 (1993) - 1991
- [j1]Lih-Hsing Hsu, Rong-Hong Jan, Yu-Che Lee, Chun-Nan Hung, Maw-Sheng Chern:
Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs. Inf. Process. Lett. 39(5): 277-281 (1991)
Coauthor Index
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-04-24 22:46 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:
