Yuejuan Han

Orcid: 0000-0002-3189-580X

According to our database1, Yuejuan Han authored at least 21 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Connectivity and diagnosability of a class of recursive networks.
J. Supercomput., February, 2024

Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication.
J. Supercomput., January, 2024

Fault tolerance of recursive match networks based on <i>g</i>-good-neighbor fault pattern.
Appl. Math. Comput., January, 2024

2023
Super-Connectivity of the Folded Locally Twisted Cube.
Symmetry, July, 2023

Communication performance and vertex-transitivity on folded locally twisted cube.
Int. J. Comput. Math. Comput. Syst. Theory, April, 2023

Structure Fault Tolerance of Bubble-Sort Star Graphs.
Inf., February, 2023

Reliability evaluation of complete graph-based recursive networks.
Theor. Comput. Sci., 2023

2022
Structure fault tolerance of WK-recursive networks.
Theor. Comput. Sci., 2022

Hamiltonian Properties of the Dragonfly Network.
Proceedings of the New Trends in Computer Technologies and Applications, 2022

2020
Communication Performance Evaluation of the Locally Twisted Cube.
Int. J. Found. Comput. Sci., 2020

Embedding Augmented Cubes into Grid Networks for Minimum Wirelength.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2020

2019
Optimally Embedding 3-Ary n-Cubes into Grids.
J. Comput. Sci. Technol., 2019

2018
Super spanning connectivity on WK-recursive networks.
Theor. Comput. Sci., 2018

Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2018

2015
One-to-one disjoint path covers on alternating group graphs.
Theor. Comput. Sci., 2015

One-to-One Disjoint Path Covers on Mesh.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015

2014
An Algorithm to Embed a Family of Node-Disjoint 3D Meshes into Locally Twisted Cubes.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2014

2013
Changing the diameter of the locally twisted cube.
Int. J. Comput. Math., 2013

2012
Adaptive Diagnosis in the Locally Twisted Cube.
Proceedings of the Fifth International Symposium on Parallel Architectures, 2012

2011
An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes.
Proceedings of the Fourth International Symposium on Parallel Architectures, 2011

2010
Embedding meshes into locally twisted cubes.
Inf. Sci., 2010


  Loading...