| 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 |
Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelength
International Journal of Foundations of Computer Science | 2024-04-24 | Paper |
An algorithm for conditional-fault local diagnosis of multiprocessor systems under the \(\mathrm{MM}^\ast\) model
Theoretical Computer Science | 2024-03-01 | 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 |
Edge-independent spanning trees in folded crossed cubes
Theoretical Computer Science | 2023-08-08 | Paper |
Reliability evaluation of complete graph-based recursive networks
Theoretical Computer Science | 2023-06-21 | Paper |
Reliabilities for two kinds of graphs with smaller diameters
Applied Mathematics and Computation | 2023-04-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 |
Connectivity and constructive algorithms of disjoint paths in dragonfly networks
Theoretical Computer Science | 2022-06-13 | Paper |
Embedding complete multi-partite graphs into Cartesian product of paths and cycles
Electronic Journal of Graph Theory and Applications | 2022-03-14 | Paper |
Efficient algorithms for support path with time constraint
Journal of Combinatorial Optimization | 2021-08-11 | Paper |
Constructing node-independent spanning trees in augmented cubes
Fundamenta Informaticae | 2021-05-20 | Paper |
Communication Performance Evaluation of the Locally Twisted Cube
International Journal of Foundations of Computer Science | 2021-04-20 | Paper |
The conditional-(g,d,k)-connectivity and conditional-(g,d,k)-edge-connectivity on the hypercubes
Fundamenta Informaticae | 2020-11-16 | Paper |
The reliability analysis of \(k\)-ary \(n\)-cube networks
Theoretical Computer Science | 2020-08-17 | Paper |
Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
Information Sciences | 2020-07-20 | 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 |
Reliability analysis of data center networks based on precise and imprecise diagnosis strategies
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 |
IRIBE: intrusion-resilient identity-based encryption
Information Sciences | 2018-05-22 | Paper |
A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
International Journal of Foundations of Computer Science | 2018-05-14 | Paper |
Super spanning connectivity on WK-recursive networks
Theoretical Computer Science | 2018-02-06 | Paper |
Cycles embedding in exchanged crossed cube
International Journal of Foundations of Computer Science | 2017-04-26 | Paper |
Edge-independent spanning trees in augmented cubes
Theoretical Computer Science | 2017-03-16 | Paper |
Conditional fault-tolerant routing of (n,k)-star graphs
International Journal of Computer Mathematics | 2017-01-27 | Paper |
Constructing completely independent spanning trees in crossed cubes
Discrete Applied Mathematics | 2017-01-23 | Paper |
Structure connectivity and substructure connectivity of hypercubes
Theoretical Computer Science | 2016-05-18 | Paper |
The restricted h-connectivity of the data center network DCell
Discrete Applied Mathematics | 2016-03-18 | Paper |
An efficient algorithm to construct disjoint path covers of DCell networks
Theoretical Computer Science | 2015-12-08 | Paper |
Hamiltonian properties of honeycomb meshes
Information Sciences | 2015-09-23 | Paper |
One-to-one disjoint path covers on alternating group graphs
Theoretical Computer Science | 2014-12-02 | Paper |
On the metric dimension of HDN
Journal of Discrete Algorithms | 2014-04-28 | 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 |
Changing the diameter of the locally twisted cube
International Journal of Computer Mathematics | 2013-10-08 | Paper |
One-to-one communication in twisted cubes under restricted connectivity
Frontiers of Computer Science in China | 2013-07-04 | Paper |
The spined cube: a new hypercube variant with smaller diameter
Information Processing Letters | 2013-03-28 | Paper |
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science | 2013-01-07 | Paper |
| New forward-secure signature scheme with untrusted update | 2012-10-26 | Paper |
Forward-secure identity-based public-key encryption without random oracles
Fundamenta Informaticae | 2012-05-04 | Paper |
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing | 2012-02-14 | Paper |
An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
Theoretical Computer Science | 2011-07-14 | Paper |
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences | 2011-06-22 | Paper |
Embedding meshes into twisted-cubes
Information Sciences | 2011-06-22 | Paper |
Forward-secure identity-based signature: security notions and construction
Information Sciences | 2011-01-28 | Paper |
Embedding meshes into locally twisted cubes
Information Sciences | 2010-09-08 | Paper |
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters | 2009-08-27 | Paper |
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences | 2009-08-14 | Paper |
Embedding of cycles in twisted cubes with edge-pancyclic
Algorithmica | 2008-07-01 | Paper |
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences | 2008-01-11 | Paper |
Embedding meshes into crossed cubes
Information Sciences | 2007-07-25 | Paper |
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing | 2007-02-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Complete path embeddings in crossed cubes
Information Sciences | 2006-10-19 | Paper |
Hamilton-connectivity and cycle-embedding of the Möbius cubes
Information Processing Letters | 2002-07-14 | Paper |
