Baolei Cheng
Orcid: 0000-0001-9479-8372
According to our database1,
Baolei Cheng
authored at least 73 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Structure Fault-Tolerant Hamiltonian Cycle and Path Embeddings in Bipartite $k$-Ary $n$-Cube Networks.
IEEE Trans. Reliab., March, 2024
J. Supercomput., February, 2024
Enhancing fault tolerance of balanced hypercube networks by the edge partition method.
Theor. Comput. Sci., February, 2024
Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication.
J. Supercomput., January, 2024
Theor. Comput. Sci., January, 2024
Construction algorithms of fault-tolerant paths and disjoint paths in <i>k</i>-ary <i>n</i>-cube networks.
J. Parallel Distributed Comput., January, 2024
Fault tolerance of recursive match networks based on <i>g</i>-good-neighbor fault pattern.
Appl. Math. Comput., January, 2024
2023
J. Supercomput., August, 2023
Relationship Between Component Connectivity And Component Diagnosability Of Some Regular Networks.
Comput. J., August, 2023
Comput. J., August, 2023
J. Comput. Sci. Technol., July, 2023
J. Interconnect. Networks, June, 2023
Theor. Comput. Sci., February, 2023
Theor. Comput. Sci., 2023
A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks.
Theor. Comput. Sci., 2023
Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2023
2022
Theor. Comput. Sci., 2022
Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks.
IEEE Trans. Computers, 2022
J. Parallel Distributed Comput., 2022
Comput. J., 2022
Proceedings of the New Trends in Computer Technologies and Applications, 2022
Proceedings of the 28th IEEE International Conference on Parallel and Distributed Systems, 2022
2021
Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube.
IEEE Trans. Parallel Distributed Syst., 2021
Theor. Comput. Sci., 2021
Int. J. Parallel Program., 2021
Comput. J., 2021
A Parallel Algorithm to Construct Node-Independent Spanning Trees on the Line Graph of Locally Twisted Cube.
Proceedings of the 12th International Symposium on Parallel Architectures, 2021
Proceedings of the Algorithms and Architectures for Parallel Processing, 2021
Proceedings of the 32nd IEEE International Conference on Application-specific Systems, 2021
2020
IEEE Trans. Parallel Distributed Syst., 2020
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements.
J. Comput. Sci. Technol., 2020
Fundam. Informaticae, 2020
An improved algorithm to construct edge-independent spanning trees in augmented cubes.
Discret. Appl. Math., 2020
Proceedings of the Network and Parallel Computing, 2020
Proceedings of the Eighth International Conference on Advanced Cloud and Big Data, 2020
2019
J. Supercomput., 2019
The extra connectivity, extra conditional diagnosability and <i>t</i>/<i>k</i>-diagnosability of the data center network DCell.
Theor. Comput. Sci., 2019
Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme.
J. Parallel Distributed Comput., 2019
J. Comput. Sci. Technol., 2019
Proceedings of the 21st IEEE International Conference on High Performance Computing and Communications; 17th IEEE International Conference on Smart City; 5th IEEE International Conference on Data Science and Systems, 2019
2018
J. Comput. Sci., 2018
Int. J. Comput. Math. Comput. Syst. Theory, 2018
Constructing independent spanning trees with height n on the n-dimensional crossed cube.
Future Gener. Comput. Syst., 2018
Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2018
2017
基于顶点度数的完全独立生成树研究 (Research on Completely Independent Spanning Trees Based on Degree of Vertices).
计算机科学, 2017
J. Parallel Distributed Comput., 2017
Discret. Appl. Math., 2017
Concurr. Comput. Pract. Exp., 2017
Proceedings of the Fifth International Conference on Advanced Cloud and Big Data, 2017
2016
Optimizing Inter-server Communications by Exploiting Overlapping Communities in Online Social Networks.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2016
Proceedings of the International Conference on Advanced Cloud and Big Data, 2016
2015
Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks.
IEEE Trans. Parallel Distributed Syst., 2015
An efficient communication relay placement algorithm for content-centric wireless mesh networks.
Int. J. Commun. Syst., 2015
Proceedings of the 11th International Conference on Mobile Ad-hoc and Sensor Networks, 2015
Proceedings of the IEEE 2nd International Conference on Cyber Security and Cloud Computing, 2015
2014
Proceedings of the 2nd International Conference on Systems and Informatics, 2014
2013
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes.
J. Supercomput., 2013
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes.
J. Parallel Distributed Comput., 2013
Comput. J., 2013
Proceedings of the Network and Parallel Computing - 10th IFIP International Conference, 2013
Circular Dimensional-Permutations and Reliable Broadcasting for Hypercubes and Möbius Cubes.
Proceedings of the Network and Parallel Computing - 10th IFIP International Conference, 2013
2012
Proceedings of the Fifth International Symposium on Parallel Architectures, 2012
2011
An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges.
Theor. Comput. Sci., 2011
2010
Frontiers Comput. Sci. China, 2010