The following pages link to Baolei Cheng (Q352012):
Displayed 18 items.
- One-to-one communication in twisted cubes under restricted connectivity (Q352013) (← links)
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges (Q551165) (← links)
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell (Q1731845) (← links)
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363) (← links)
- The reliability analysis of \(k\)-ary \(n\)-cube networks (Q2192376) (← links)
- The extra connectivity and extra diagnosability of regular interconnection networks (Q2290625) (← links)
- An improved algorithm to construct edge-independent spanning trees in augmented cubes (Q2306584) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- Connectivity and constructive algorithms of disjoint paths in dragonfly networks (Q2672591) (← links)
- The \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubes (Q2682911) (← links)
- Constructing Node-Independent Spanning Trees in Augmented Cubes (Q4988941) (← links)
- Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks (Q5095079) (← links)
- Independent spanning trees in crossed cubes (Q5971214) (← links)
- Fault tolerance of recursive match networks based on \(g\)-good-neighbor fault pattern (Q6068172) (← links)
- Reliability evaluation of complete graph-based recursive networks (Q6100189) (← links)
- Reliability evaluation for a class of recursive match networks (Q6118306) (← links)
- Enhancing fault tolerance of balanced hypercube networks by the edge partition method (Q6138833) (← links)