Chun-Nan Hung

According to our database1, Chun-Nan Hung authored at least 35 papers between 1991 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model.
Fundam. Informaticae, 2022

2021
Neighbor Connectivity of the Alternating Group Graph.
J. Interconnect. Networks, 2021

On the Neighborhood-Connectivity of Locally Twisted Cube Networks.
Proceedings of the Innovative Mobile and Internet Services in Ubiquitous Computing, 2021

2020
Edge-pancyclicity of pancake graph.
Int. J. Comput. Math. Comput. Syst. Theory, 2020

2-spanning cyclability problems of the some generalized Petersen graphs.
Discuss. Math. Graph Theory, 2020

2019
Combinatorial analytics on the localized subcube reliability of hypercube networks<sup>*</sup>.
Proceedings of the 20th IEEE/ACIS International Conference on Software Engineering, 2019

The Cycles Embedding in Pancake Networks.
Proceedings of the 20th IEEE/ACIS International Conference on Software Engineering, 2019

2018
Fault-Hamiltonicity of Cartesian products of directed cycles.
Art Discret. Appl. Math., 2018

On the Channel Congestion of the Shortest-Path Routing for Unidirectional Hypercube Networks.
Proceedings of the Innovative Mobile and Internet Services in Ubiquitous Computing, 2018

Construction Schemes for Edge Fault-Tolerance of Ring Networks.
Proceedings of the Innovative Mobile and Internet Services in Ubiquitous Computing, 2018

2017
Estimating the subsystem reliability of bubblesort networks.
Theor. Comput. Sci., 2017

Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions.
Parallel Process. Lett., 2017

Accurate Reliability Estimation Based on the Collection of First-Order Subsystems in the Bubblesort Network.
Proceedings of the 5th International Conference on Applied Computing and Information Technology, 2017

The Arcs Fault-Tolerance for 4-Pancyclic Properties of Unidirectional Hypercubes.
Proceedings of the 5th International Conference on Applied Computing and Information Technology, 2017

2016
On the Robust Approach to Data Inconsistency Detection of Sensor Networks.
Proceedings of the 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2016

A Framework of Cycle-Based Clustering on the Crossed Cube Architecture.
Proceedings of the 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2016

2015
On Hamiltonian properties of unidirectional hypercubes.
Inf. Process. Lett., 2015

2013
4-ordered-Hamiltonian problems of the generalized Petersen graph <i>GP</i>(<i>n</i>, 4).
Math. Comput. Model., 2013

2011
Embedding Cycles into Hypercubes with Prescribe Vertices in the Specific Order.
Proceedings of the 14th IEEE International Conference on Computational Science and Engineering, 2011

2007
Hamiltonian laceability of Faulty Hypercubes.
J. Interconnect. Networks, 2007

On cubic 2-independent Hamiltonian connected graphs.
J. Comb. Optim., 2007

2006
Longest Paths and Cycles in Faulty Hypercubes.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2006

2003
Ring embedding in faulty pancake graphs.
Inf. Process. Lett., 2003

2002
Fault-Tolerant Hamiltonicity of Twisted Cubes.
J. Parallel Distributed Comput., 2002

Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs.
Proceedings of the International Symposium on Parallel Architectures, 2002

2001
On the construction of combined k-fault-tolerant Hamiltonian graphs.
Networks, 2001

2000
On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks.
IEEE Trans. Parallel Distributed Syst., 2000

Construction schemes for fault-tolerant Hamiltonian graphs.
Networks, 2000

1999
The correct diameter of trivalent Cayley graphs.
Inf. Process. Lett., 1999

Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings.
Inf. Process. Lett., 1999

1998
Optimal 1-Hamiltonian Graphs.
Inf. Process. Lett., 1998

Christmas Tree: A 1-Fault-Tolerant Network for Token Rings.
Proceedings of the International Conference on Parallel and Distributed Systems, 1998

1996
A response to Volgenant's Addendum on the most vital edges.
Networks, 1996

1993
The most vital edges of matching in a bipartite graph.
Networks, 1993

1991
Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs.
Inf. Process. Lett., 1991


  Loading...