| Publication | Date of Publication | Type |
|---|
The generalized 3-connectivity of BCCC data center networks
Discrete Applied Mathematics | 2026-03-19 | Paper |
Completely independent spanning trees in the line graph of complete multipartite graphs
Theoretical Computer Science | 2026-02-12 | Paper |
| Fault diagnosability evaluation of BCCC data center networks | 2026-01-28 | Paper |
On completely edge-independent spanning trees in locally twisted cubes
Fundamenta Informaticae | 2025-10-01 | Paper |
| Construction algorithm of vertex-disjoint paths in circulant-based recursive networks | 2025-07-23 | Paper |
Unpaired set-to-set disjoint path routings in recursive match networks
Theoretical Computer Science | 2025-02-26 | Paper |
Edge-disjoint Hamiltonian cycles in balanced hypercubes with applications to fault-tolerant data broadcasting
International Journal of Foundations of Computer Science | 2025-02-05 | Paper |
Vertex-independent spanning trees in complete Josephus cubes
Theoretical Computer Science | 2024-12-12 | Paper |
High fault-tolerant performance of the divide-and-swap cube network
Theoretical Computer Science | 2024-11-06 | Paper |
Reliability evaluation for a class of recursive match networks
Theoretical Computer Science | 2024-02-23 | Paper |
Enhancing fault tolerance of balanced hypercube networks by the edge partition method
Theoretical Computer Science | 2024-01-16 | Paper |
Fault tolerance of recursive match networks based on \(g\)-good-neighbor fault pattern
Applied Mathematics and Computation | 2023-11-13 | Paper |
Reliability evaluation of complete graph-based recursive networks
Theoretical Computer Science | 2023-06-21 | Paper |
The \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubes
Theoretical Computer Science | 2023-02-01 | Paper |
A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
Theoretical Computer Science | 2022-12-21 | Paper |
Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks
IEEE Transactions on Computers | 2022-08-05 | Paper |
Connectivity and constructive algorithms of disjoint paths in dragonfly networks
Theoretical Computer Science | 2022-06-13 | Paper |
Constructing node-independent spanning trees in augmented cubes
Fundamenta Informaticae | 2021-05-20 | Paper |
The reliability analysis of \(k\)-ary \(n\)-cube networks
Theoretical Computer Science | 2020-08-17 | Paper |
An improved algorithm to construct edge-independent spanning trees in augmented cubes
Discrete Applied Mathematics | 2020-03-23 | Paper |
The extra connectivity and extra diagnosability of regular interconnection networks
Theoretical Computer Science | 2020-01-29 | Paper |
The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
Theoretical Computer Science | 2019-03-14 | Paper |
Constructing completely independent spanning trees in crossed cubes
Discrete Applied Mathematics | 2017-01-23 | Paper |
Independent spanning trees in crossed cubes
Information Sciences | 2014-04-16 | Paper |
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing | 2014-04-02 | Paper |
One-to-one communication in twisted cubes under restricted connectivity
Frontiers of Computer Science in China | 2013-07-04 | Paper |
An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
Theoretical Computer Science | 2011-07-14 | Paper |
