Xiang-Jun Li

dblp:129/8139 · DBLP profile ↗
← Back
15ranked-venue papers
7as first author
8since 2021 · last 2024
0000-0003-1194-1124ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 10 · 6 first-author · 4 since 2021Systems, architecture and hardware · 4 · 4 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-authorComputer networks · 1 · 1 first-author
YearPublicationVenuePosition
2024 Generalized fault-tolerance for enhanced hypercubes
Meijie Ma, Xiang-Jun Li, Yongli Zan
Discret. Appl. Math.2
2024 Reliability of m-ary n-dimensional hypercubes under embedded restriction
Ying-Ze Zhao, Xiang-Jun Li, Jia-Sheng Li, Meijie Ma
Discret. Appl. Math.2
2024 The Rabin numbers of enhanced hypercubes
Chaoming Guo, Meijie Ma, Xiang-Jun Li
J. Parallel Distributed Comput.3
2024 Reliability assessment for k-ary n-cubes with faulty edges
Xiang-Jun Li, Meijie Ma
J. Parallel Distributed Comput.2
2022 Reliability assessment for modified bubble-sort networks
Xiang-Jun Li, Meijie Ma
Discret. Appl. Math.2
2022 Reliability of arrangement networks in terms of the h-restricted edge connectivity
Xue-Qian Zeng, Xiang-Jun Li, Meijie Ma
J. Parallel Distributed Comput.3
2022 Note on reliability of star graphs
Chai Shu, Xiang-Jun Li, Meijie Ma
Theor. Comput. Sci.2
2022 Embedded connectivity of some BC networks
Ying-Ze Zhao, Xiang-Jun Li, Meijie Ma
J. Supercomput.2
2019 On conditional fault tolerance of hierarchical cubic networks
Xiang-Jun Li, Zheng Yan 0006, Jun-Ming Xu 0001
Theor. Comput. Sci.1
2017 Many-to-many disjoint paths in hypercubes with faulty vertices
Xiang-Jun Li, Bin Liu 0063, Meijie Ma, Jun-Ming Xu 0001
Discret. Appl. Math.1
2017 On fault tolerance of (n, k)-star networks
Xiang-Jun Li, Yong-Ni Guan, Zheng Yan 0006, Jun-Ming Xu 0001
Theor. Comput. Sci.1
2016 Embedded connectivity of recursive networks
Xiang-Jun Li, Qi-Qi Dong, Zheng Yan 0006, Jun-Ming Xu 0001
Theor. Comput. Sci.1
2014 Generalized measures for fault tolerance of star networks
abstract
This article shows that, for any integers n and k with , at least vertices or edges have to be removed from an n-dimensional star graph to make it disconnected with no vertices of degree less than k. The result gives an affirmative answer to the conjecture proposed by Wan and Zhang (Appl Math Lett 22 (2009), 264-267).Copyright © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 63(3), 225–230 2014
Xiang-Jun Li, Jun-Ming Xu 0001
Networks1
2013 Generalized measures of fault tolerance in exchanged hypercubes
Xiang-Jun Li, Jun-Ming Xu 0001
Inf. Process. Lett.1
2013 Edge-fault tolerance of hypercube-like networks
Xiang-Jun Li, Jun-Ming Xu 0001
Inf. Process. Lett.1