default search action
Dajin Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j67]Guozhen Zhang, Xin Liu, Dajin Wang
:
Component connectivity of wheel networks. Appl. Math. Comput. 487: 129096 (2025) - 2024
- [j66]Min Li, Shuming Zhou
Missing link prediction using path and community information. Computing 106(2): 521-555 (2024) - [j65]Hongbin Zhuang
Enabling high fault-tolerant embedding capability of alternating group graphs. Future Gener. Comput. Syst. 158: 110-121 (2024) - [j64]Jiarong Liang
On the Reconstruction of a Quality Virtual Backbone in a Wireless Sensor Network With Faulty Links. IEEE Trans. Netw. Sci. Eng. 11(1): 1277-1292 (2024) - [i2]Xiaorui Li, Baolei Cheng, Jianxi Fan, Yan Wang, Dajin Wang:
On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes. CoRR abs/2401.01585 (2024) - 2023
- [j63]Baolei Cheng
Independent Spanning Trees in Networks: A Survey. ACM Comput. Surv. 55(14s): 335:1-335:29 (2023) - [j62]Min Li, Shuming Zhou
Identifying influential nodes based on resistance distance. J. Comput. Sci. 67: 101972 (2023) - [j61]Hongbin Zhuang
An Efficient Algorithm for Hamiltonian Path Embedding of $k$k-Ary $n$n-Cubes Under the Partitioned Edge Fault Model. IEEE Trans. Parallel Distributed Syst. 34(6): 1802-1815 (2023) - 2022
- [j60]Jiafei Liu
Component diagnosability in terms of component connectivity of hypercube-based compound networks. J. Parallel Distributed Comput. 162: 17-26 (2022) - [j59]Yifeng Wang
Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks. IEEE Trans. Computers 71(5): 1194-1203 (2022) - 2021
- [j58]Guozhen Zhang, Dajin Wang:
The structure fault tolerance of arrangement graphs. Appl. Math. Comput. 400: 126039 (2021) - [j57]Qiang Zhu
A new approach to finding the extra connectivity of graphs. Discret. Appl. Math. 294: 265-271 (2021) - [j56]Limei Lin
A Novel Measurement for Network Reliability. IEEE Trans. Computers 70(10): 1719-1731 (2021) - [j55]Jiafei Liu
Fault diagnosability of Bicube networks under the PMC diagnostic model. Theor. Comput. Sci. 851: 14-23 (2021) - [j54]Guo Chen, Baolei Cheng
Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube. IEEE Trans. Parallel Distributed Syst. 32(3): 665-673 (2021) - 2020
- [j53]Cheng-Kuan Lin, Tzu-Liang Kung, Dajin Wang, Yuan-Hsiang Teng:
The Diagnosability of (K4 - {e})-free Graphs under the PMC Diagnosis Model. Fundam. Informaticae 177(2): 181-188 (2020) - [j52]Zhendong Gu, Shuming Zhou
Shapley Distance and Shapley Index for Some Special Graphs. Parallel Process. Lett. 30(4): 2050012:1-2050012:17 (2020)
2010 – 2019
- 2019
- [j51]Yanze Huang, Limei Lin
Minimum Neighborhood of Alternating Group Graphs. IEEE Access 7: 17299-17311 (2019) - [j50]Guozhen Zhang
Structure Connectivity and Substructure Connectivity of k-Ary n-Cube Networks. IEEE Access 7: 134496-134504 (2019) - [j49]Limei Lin
Component Reliability Evaluation on Split-Stars. IEEE Access 7: 147939-147953 (2019) - [j48]Guozhen Zhang, Dajin Wang:
Structure connectivity and substructure connectivity of bubble-sort star graph networks. Appl. Math. Comput. 363 (2019) - [j47]Liwei Lin
vSimilar: A high-adaptive VM scheduler based on the CPU pool mechanism. J. Syst. Archit. 98: 361-373 (2019) - [j46]Mengjie Lv, Shuming Zhou, Xueli Sun, Guanqin Lian, Jiafei Liu, Dajin Wang:
Probabilistic diagnosis of clustered faults for hypercube-based multiprocessor system. Theor. Comput. Sci. 793: 113-131 (2019) - [j45]Limei Lin
Relating Extra Connectivity and Extra Conditional Diagnosability in Regular Networks. IEEE Trans. Dependable Secur. Comput. 16(6): 1086-1097 (2019) - 2018
- [j44]Dawei Li
Software-Defined Networking Switches for Fast Single-Link Failure Recovery. J. Interconnect. Networks 18(4): 1850014:1-1850014:17 (2018) - [j43]Shuangjiao Zhai
Enhancing Received Signal Strength-Based Localization through Coverage Hole Detection and Recovery. Sensors 18(7): 2075 (2018) - [j42]Yanze Huang, Limei Lin
On the reliability of alternating group graph-based networks. Theor. Comput. Sci. 728: 9-28 (2018) - [j41]Limei Lin, Li Xu, Dajin Wang, Shuming Zhou:
The g-Good-Neighbor Conditional Diagnosability of Arrangement Graphs. IEEE Trans. Dependable Secur. Comput. 15(3): 542-548 (2018) - 2017
- [j40]Baolei Cheng, Dajin Wang, Jianxi Fan:
Constructing completely independent spanning trees in crossed cubes. Discret. Appl. Math. 219: 100-109 (2017) - [j39]Li Xu, Jing Zhang, Pei-Wei Tsai
Uncertain random spectra: a new metric for assessing the survivability of mobile wireless sensor networks. Soft Comput. 21(10): 2619-2629 (2017) - [j38]Shuming Zhou, Xiaowang Li, Jinqiang Li
Reliability Assessment of Multiprocessor System Based on (n, k)-Star Network. IEEE Trans. Reliab. 66(4): 1025-1035 (2017) - [c23]Shuangjiao Zhai, Zhanyong Tang, Dajin Wang, Zhanglei Li, Xiaojiang Chen, Dingyi Fang, Feng Chen:
Coverage Hole Detection and Recovery in Wireless Sensor Networks Based on RSSI-Based Localization. CSE/EUC (2) 2017: 250-257 - 2016
- [j37]Juncheng Jia, Dajin Wang, Zhengqiu He, Jianxi Fan, Shukui Zhang, Jin Wang, Jianfeng Yan:
In-band bootstrapping in database-driven multi-hop cognitive radio networks. Int. J. Commun. Syst. 29(17): 2542-2554 (2016) - [j36]Cheng-Kuan Lin, Lili Zhang, Jianxi Fan, Dajin Wang:
Structure connectivity and substructure connectivity of hypercubes. Theor. Comput. Sci. 634: 97-107 (2016) - [j35]Xiaowang Li, Shuming Zhou, Xiang Xu, Limei Lin, Dajin Wang:
The Reliability Analysis Based on Subsystems of (n, k)-Star Graph. IEEE Trans. Reliab. 65(4): 1700-1709 (2016) - [i1]Qiang Zhu, Fang Ma, Guodong Guo, Dajin Wang, Weisheng Chen:
From Graph Isoperimetric Inequality to Network Connectivity - A New Approach. CoRR abs/1607.07761 (2016) - 2015
- [j34]Yuanchao Liu, Jianxi Fan, Dajin Wang, Hongwei Du, Shukui Zhang, Jing Lv:
Approximate Algorithms for Vertex Cover Problems in WSN Topology Design. Ad Hoc Sens. Wirel. Networks 28(1-2): 19-39 (2015) - [j33]Haigang Gong, Dajin Wang, Shigeng Zhang, Nianbo Liu
Algorithmic Methods in Wireless Sensor Network 2014. Int. J. Distributed Sens. Networks 11: 805091:1-805091:2 (2015) - [j32]Shuming Zhou, Limei Lin, Li Xu, Dajin Wang:
The t/k-Diagnosability of Star Graph Networks. IEEE Trans. Computers 64(2): 547-555 (2015) - [j31]Limei Lin, Shuming Zhou, Li Xu, Dajin Wang:
The Extra Connectivity and Conditional Diagnosability of Alternating Group Networks. IEEE Trans. Parallel Distributed Syst. 26(8): 2352-2362 (2015) - [j30]Limei Lin, Li Xu, Shuming Zhou, Dajin Wang:
The Reliability of Subgraphs in the Arrangement Graph. IEEE Trans. Reliab. 64(2): 807-818 (2015) - [c22]Baolei Cheng, Jianxi Fan, Dajin Wang, Jiwen Yang:
A Reliable Broadcasting Algorithm in Locally Twisted Cubes. CSCloud 2015: 323-328 - [c21]Dajin Wang, Juncheng Jia, Liwei Lin:
A cost-effective scheme for restoring connectivity of disconnected WSNs. ICOIN 2015: 69-74 - [c20]Lili Zhang, Xiaoqiang Chen, Jianxi Fan, Dajin Wang, Cheng-Kuan Lin:
The Minimal Exposure Path in Mobile Wireless Sensor Network. PAAP 2015: 73-79 - 2014
- [j29]Qiang Zhu, Guodong Guo
Relating Diagnosability, Strong Diagnosability and Conditional Diagnosability of Strong Networks. IEEE Trans. Computers 63(7): 1847-1851 (2014) - [j28]Limei Lin, Shuming Zhou, Li Xu, Dajin Wang:
Conditional diagnosability of arrangement graphs under the PMC model. Theor. Comput. Sci. 548: 79-97 (2014) - [c19]Juncheng Jia, Dajin Wang, Jianxi Fan, Shukui Zhang:
In-band bootstrapping in database-driven multi-hop cognitive radio networks. CCNC 2014: 611-616 - [c18]Dajin Wang, Liangyan Gui:
Relay Channel with Causal Channel State Information. VTC Fall 2014: 1-5 - [c17]Dajin Wang, Ou Wang:
An Approximate Method of Carrier Frequency Offset (CFO) Estimation for OFDM System. VTC Fall 2014: 1-2 - [c16]Dajin Wang:
Compress-forward strategy with non-causal channel state information at the relay. WCNC 2014: 1974-1978 - 2013
- [j27]Ming Yang, Dajin Wang, Nikolaos G. Bourbakis:
Optimization of Power Allocation in Multimedia Wireless Sensor Networks. Int. J. Monit. Surveillance Technol. Res. 1(1): 56-68 (2013) - 2012
- [j26]Dajin Wang:
Constructing optimal subnetworks for the crossed cube network. Networks 60(2): 86-93 (2012) - [j25]Dajin Wang:
Hamiltonian Embedding in Crossed Cubes with Failed Links. IEEE Trans. Parallel Distributed Syst. 23(11): 2117-2124 (2012) - [c15]Dajin Wang, Liangyan Gui:
Noisy network coding with causal channel state information. NetCod 2012: 67-72 - 2011
- [j24]Dajin Wang, Liwei Lin, Li Xu:
A study of subdividing hexagon-clustered WSN for power saving: Analysis and simulation. Ad Hoc Networks 9(7): 1302-1311 (2011) - 2010
- [j23]Dajin Wang:
A Power-Mitigating Scheme for Clusterheads in Wireless Sensor Networks. Ad Hoc Sens. Wirel. Networks 9(3-4): 239-253 (2010) - [j22]Qiang Dong
Embedding multi-dimensional meshes into twisted cubes. Comput. Electr. Eng. 36(6): 1021-1026 (2010) - [j21]Dajin Wang:
Clustering mesh-like wireless sensor networks with an energy-efficient scheme. Int. J. Sens. Networks 7(4): 199-206 (2010) - [j20]Qiang Dong
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links. Inf. Sci. 180(1): 198-208 (2010)
2000 – 2009
- 2009
- [c14]Dajin Wang:
An Analytical Study of Subdividing Hexagon-Clustered WSN for Power Saving. MASS 2009: 403-412 - 2008
- [j19]Dajin Wang:
An Energy-efficient Clusterhead Assignment Scheme for Hierarchical Wireless Sensor Networks. Int. J. Wirel. Inf. Networks 15(2): 61-71 (2008) - [j18]Jason Zurawski
Fault-tolerance schemes for clusterheads in clustered mesh networks. Int. J. Parallel Emergent Distributed Syst. 23(3): 271-287 (2008) - [j17]Dajin Wang:
A linear-time algorithm for computing collision-free path on reconfigurable mesh. Parallel Comput. 34(9): 487-496 (2008) - [j16]Dajin Wang:
On Embedding Hamiltonian Cycles in Crossed Cubes. IEEE Trans. Parallel Distributed Syst. 19(3): 334-346 (2008) - [j15]Zhen Jiang, Jie Wu, Dajin Wang:
A New Fault-Information Model for Adaptive & Minimal Routing in 3-D Meshes. IEEE Trans. Reliab. 57(1): 149-162 (2008) - [c13]Salman Siddiqui, Stefan A. Robila
Sparse Representations for Hyperspectral Data Classification. IGARSS (2) 2008: 577-580 - 2007
- [j14]Dajin Wang:
An Empirical Study of Hierarchical Division for Mesh-Structured Networks. J. Interconnect. Networks 8(3): 285-304 (2007) - [j13]Dajin Wang:
A heuristic fault-tolerant routing algorithm in mesh using rectilinear-monotone polygonal fault blocks. J. Syst. Archit. 53(9): 619-628 (2007) - [c12]Dajin Wang:
A Power-Balancing Scheme for Clustered Wireless Sensor Networks. FGCN (1) 2007: 231-236 - 2006
- [j12]Dajin Wang:
An empirical study of hierarchical division for mesh-structured networks. J. Comput. Methods Sci. Eng. 6(5-6): 413-426 (2006) - [c11]Zhiwei Lin, Li Xu, Dajin Wang, Jianliang Gao:
A Coloring Based Backbone Construction Algorithm in Wireless Ad Hoc Network. GPC 2006: 509-516 - [c10]Dajin Wang:
Clustering Mesh-Like Wireless Sensor Networks with an Energy-Efficient Scheme (an Extended Abstract). MASS 2006: 509-512 - [c9]Dajin Wang:
A Graph-Center-Based Scheme for Energy-Efficient Data Collection in Wireless Sensor Networks. MSN 2006: 579-587 - [c8]Dajin Wang:
An Algorithm to Embed Hamiltonian Cycles in Crossed Cubes. PARELEC 2006: 49-54 - 2005
- [j11]Jie Wu, Dajin Wang:
Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks. Parallel Algorithms Appl. 20(2): 99-111 (2005) - [c7]Zhen Jiang, Jie Wu, Dajin Wang:
A New Fault Information Model for Fault-Tolerant Adaptive and Minimal Routing in 3-D Meshes. ICPP 2005: 500-507 - [c6]Jason Zurawski
Fault-Tolerance Schemes for Hierarchical Mesh Networks. PDCAT 2005: 498-502 - 2004
- [j10]Dajin Wang, Jiannong Cao
On Hierarchical Configuration Of Distributed Systems On Mesh And Hypercube. Int. J. Found. Comput. Sci. 15(3): 517-534 (2004) - [c5]Dajin Wang:
Inducing Symmetrically Connected, All-Node Subgraphs from the Crossed Cube. SNPD 2004: 312-319 - 2003
- [j9]Dajin Wang:
A Rectilinear-Monotone Polygonal Fault Block Model for Fault-Tolerant Minimal Routing in Mesh. IEEE Trans. Computers 52(3): 310-320 (2003) - [c4]Dajin Wang, Jiannong Cao
On Optimal Hierarchical Configuration of Distributed Systems on Mesh and Hypercube. IPDPS 2003: 167 - 2002
- [c3]Jie Wu, Dajin Wang:
Fault-Tolerant and Deadlock-Free Routing in 2-D Meshes Using Rectilinear-Monotone Polygonal Fault Blocks. ICPP 2002: 247-256 - 2001
- [j8]Dajin Wang:
Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links. J. Parallel Distributed Comput. 61(4): 545-564 (2001) - [j7]Dajin Wang:
A Low-Cost Fault-Tolerant Structure for the Hypercube. J. Supercomput. 20(3): 203-216 (2001) - 2000
- [j6]Dajin Wang:
The diagnosability of hypercubes with arbitrarily missing links. J. Syst. Archit. 46(6): 519-527 (2000) - [c2]John Jing-Fu Jenq, Dajin Wang:
Parallel Computation of Configuration Space on Reconfigurable Mesh with Faults. ICPP Workshops 2000: 259-266
1990 – 1999
- 1999
- [j5]Dajin Wang:
Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model. IEEE Trans. Computers 48(12): 1369-1374 (1999) - 1998
- [j4]Dajin Wang, Klaus Sutner:
Two algorithms for a reachability problem in one-dimensional space. IEEE Trans. Syst. Man Cybern. Part A 28(4): 478-486 (1998) - 1997
- [j3]Dajin Wang, Zhongxian Wang:
Minimum Assignment of Test Links for Hypercubes with Lower Fault Bounds. J. Parallel Distributed Comput. 40(2): 185-193 (1997) - 1995
- [c1]Dajin Wang:
A Fault-Tolerant Structure for the Hypercube. Parallel and Distributed Computing and Systems 1995: 339-343 - 1994
- [j2]Dajin Wang:
Diagnosability of Enhanced Hypercubes. IEEE Trans. Computers 43(9): 1054-1061 (1994) - 1993
- [j1]Dajin Wang:
A note on "Diagnosabilities of hypercubes under the pessimistic one-step diagnosis strategy". SIGARCH Comput. Archit. News 21(5): 71-78 (1993)
Coauthor Index
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-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: