Остановите войну!
for scientists:
default search action
Jianxi Fan
- > Home > Persons > Jianxi Fan
Publications
- 2023
- [j123]Mengjie Lv, Jianxi Fan, Weibei Fan, Xiaohua Jia:
A High-Performantal and Server-Centric Based Data Center Network. IEEE Trans. Netw. Sci. Eng. 10(2): 592-605 (2023) - [j122]Xueli Sun, Jianxi Fan, Shuangxiang Kan, Weibei Fan, Xiaohua Jia:
Component Reliability of a Class of Regular Networks and Its Applications. IEEE Trans. Reliab. 72(2): 637-650 (2023) - 2022
- [j119]Mengjie Lv, Jianxi Fan, Jingya Zhou, Jia Yu, Xiaohua Jia:
The Reliability of k-Ary n-Cube Based on Component Connectivity. Comput. J. 65(8): 2197-2208 (2022) - [j109]Mengjie Lv, Jianxi Fan, Weibei Fan, Xiaohua Jia:
Fault Diagnosis Based on Subsystem Structures of Data Center Network BCube. IEEE Trans. Reliab. 71(2): 963-972 (2022) - 2021
- [j107]Xiaoyan Li, Cheng-Kuan Lin, Jianxi Fan, Xiaohua Jia, Baolei Cheng, Jingya Zhou:
Relationship Between Extra Connectivity And Component Connectivity In Networks. Comput. J. 64(1): 38-53 (2021) - 2020
- [j92]Mengjie Lv, Jianxi Fan, Jingya Zhou, Baolei Cheng, Xiaohua Jia:
The extra connectivity and extra diagnosability of regular interconnection networks. Theor. Comput. Sci. 809: 88-102 (2020) - [j91]Xiaoyan Li, Xiaohua Jia, Jianxi Fan, Cheng-Kuan Lin:
Reliability analysis of data center networks based on precise and imprecise diagnosis strategies. Theor. Comput. Sci. 809: 189-203 (2020) - [j89]Guijuan Wang, Cheng-Kuan Lin, Jianxi Fan, Baolei Cheng, Xiaohua Jia:
A Novel Low Cost Interconnection Architecture Based on the Generalized Hypercube. IEEE Trans. Parallel Distributed Syst. 31(3): 647-662 (2020) - 2019
- [j84]Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia, Xiaoyan Li:
Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme. J. Parallel Distributed Comput. 134: 104-115 (2019) - [j83]Xiaoyan Li, Jianxi Fan, Cheng-Kuan Lin, Baolei Cheng, Xiaohua Jia:
The extra connectivity, extra conditional diagnosability and t/k-diagnosability of the data center network DCell. Theor. Comput. Sci. 766: 16-29 (2019) - 2018
- [j79]Xiaoyan Li, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia:
Diagnosability Evaluation of the Data Center Network DCell. Comput. J. 61(1): 129-143 (2018) - [j73]Yali Lv, Cheng-Kuan Lin, Jianxi Fan, Xiaohua Jia:
Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K1, 3-structure faults. J. Parallel Distributed Comput. 120: 148-158 (2018) - 2017
- [j65]Zhao Liu, Jianxi Fan, Jingya Zhou, Baolei Cheng, Xiaohua Jia:
Fault-tolerant embedding of complete binary trees in locally twisted cubes. J. Parallel Distributed Comput. 101: 69-78 (2017) - 2016
- [j56]Zhao Liu, Jianxi Fan, Xiaohua Jia:
Complete binary trees embeddings in Möbius cubes. J. Comput. Syst. Sci. 82(2): 260-281 (2016) - [j55]Xi Wang, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia:
Vertex-disjoint paths in DCell networks. J. Parallel Distributed Comput. 96: 38-44 (2016) - [j54]Xi Wang, Jianxi Fan, Xiaohua Jia, Cheng-Kuan Lin:
An efficient algorithm to construct disjoint path covers of DCell networks. Theor. Comput. Sci. 609: 197-210 (2016) - 2015
- [j51]Xi Wang, Alejandro Erickson, Jianxi Fan, Xiaohua Jia:
Hamiltonian Properties of DCell Networks. Comput. J. 58(11): 2944-2955 (2015) - [j49]Lantao You, Jianxi Fan, Yuejuan Han, Xiaohua Jia:
One-to-one disjoint path covers on alternating group graphs. Theor. Comput. Sci. 562: 146-164 (2015) - [j48]Zhao Liu, Jianxi Fan, Xiaohua Jia:
Embedding complete binary trees into parity cubes. J. Supercomput. 71(1): 1-27 (2015) - [j47]Baolei Cheng, Jianxi Fan, Xiaohua Jia:
Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks. IEEE Trans. Parallel Distributed Syst. 26(1): 45-53 (2015) - [i1]Xi Wang, Alejandro Erickson, Jianxi Fan, Xiaohua Jia:
Hamiltonian Properties of DCell Networks. CoRR abs/1510.02689 (2015) - 2013
- [j45]Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Bangrui Chen:
Constructive Algorithm of Independent Spanning Trees on Möbius Cubes. Comput. J. 56(11): 1347-1362 (2013) - [j41]Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang:
Independent spanning trees in crossed cubes. Inf. Sci. 233: 276-289 (2013) - [j40]Dacheng Xu, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Xi Wang:
Hamiltonian properties of honeycomb meshes. Inf. Sci. 240: 184-190 (2013) - [j39]Baolei Cheng, Jianxi Fan, Xiaohua Jia, Jin Wang:
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes. J. Parallel Distributed Comput. 73(5): 641-652 (2013) - [j38]Baolei Cheng, Jianxi Fan, Xiaohua Jia, Juncheng Jia:
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes. J. Supercomput. 65(3): 1279-1301 (2013) - 2012
- [j32]Yan Wang, Jianxi Fan, Guodong Zhou, Xiaohua Jia:
Independent spanning trees on twisted cubes. J. Parallel Distributed Comput. 72(1): 58-69 (2012) - [j30]Yan Wang, Jianxi Fan, Xiaohua Jia, He Huang:
An algorithm to construct independent spanning trees on parity cubes. Theor. Comput. Sci. 465: 61-72 (2012) - 2011
- [j28]Wujun Zhou, Jianxi Fan, Xiaohua Jia, Shukui Zhang:
The spined cube: A new hypercube variant with smaller diameter. Inf. Process. Lett. 111(12): 561-567 (2011) - [j25]Jianxi Fan, Xiaohua Jia, Xin Liu, Shukui Zhang, Jia Yu:
Efficient unicast in bijective connection networks with the restricted faulty node set. Inf. Sci. 181(11): 2303-2315 (2011) - [j24]Xi Wang, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Jia Yu:
Embedding meshes into twisted-cubes. Inf. Sci. 181(14): 3085-3099 (2011) - [j22]Jianxi Fan, Xiaohua Jia, Baolei Cheng, Jia Yu:
An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges. Theor. Comput. Sci. 412(29): 3440-3450 (2011) - 2009
- [c4]Jianxi Fan, Shukui Zhang, Xiaohua Jia, Guangquan Zhang:
A Fault-Free Unicast Algorithm in Twisted Cubes with the Restricted Faulty Node Set. ICPADS 2009: 316-323 - [c3]Jianxi Fan, Shukui Zhang, Xiaohua Jia, Guangquan Zhang:
The Restricted Connectivity of Locally Twisted Cubes. ISPAN 2009: 574-578 - 2008
- [j13]Jianxi Fan, Xiaohua Jia, Xiaola Lin:
Embedding of Cycles in Twisted Cubes with Edge-Pancyclic. Algorithmica 51(3): 264-282 (2008) - [j12]Jianxi Fan, Xiaohua Jia:
Edge-pancyclicity and path-embeddability of bijective connection graphs. Inf. Sci. 178(2): 340-351 (2008) - 2007
- [j11]Jianxi Fan, Xiaohua Jia:
Embedding meshes into crossed cubes. Inf. Sci. 177(15): 3151-3160 (2007) - [j10]Jianxi Fan, Xiaola Lin, Yi Pan, Xiaohua Jia:
Optimal fault-tolerant embedding of paths in twisted cubes. J. Parallel Distributed Comput. 67(2): 205-214 (2007) - [j9]Jianxi Fan, Xiaohua Jia, Xiaola Lin:
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes. IEEE Trans. Parallel Distributed Syst. 18(4): 511-521 (2007) - 2006
- [j8]Jianxi Fan, Xiaohua Jia, Xiaola Lin:
Complete path embeddings in crossed cubes. Inf. Sci. 176(22): 3332-3346 (2006) - 2005
- [j7]Jianxi Fan, Xiaola Lin, Xiaohua Jia:
Node-pancyclicity and edge-pancyclicity of crossed cubes. Inf. Process. Lett. 93(3): 133-138 (2005) - [j5]Jianxi Fan, Xiaola Lin, Xiaohua Jia:
Optimal Path Embedding in Crossed Cubes. IEEE Trans. Parallel Distributed Syst. 16(12): 1190-1200 (2005) - [c2]Jianxi Fan, Xiaola Lin, Xiaohua Jia, Rynson W. H. Lau:
Edge-Pancyclicity of Twisted Cubes. ISAAC 2005: 1090-1099 - [c1]Jianxi Fan, Xiaola Lin, Xiaohua Jia:
Embedding Paths of Different Lengths into Crossed Cubes. PDCAT 2005: 1008-1012
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-24 02:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint