Yanze Huang

Orcid: 0000-0002-9468-8701

According to our database1, Yanze Huang authored at least 31 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Probabilistic Reliability via Subsystem Structures of Arrangement Graph Networks.
IEEE Trans. Reliab., March, 2024

2023
Component Fault Diagnosis and Fault Tolerance of Alternating Group Graphs.
Comput. J., May, 2023

Intermittent Fault Diagnosis of Split-Star Networks and its Applications.
IEEE Trans. Parallel Distributed Syst., April, 2023

Fault Diagnosability of Networks With Fault-Free Block at Local Vertex Under MM* Model.
IEEE Trans. Reliab., March, 2023

Efficient survivable mapping algorithm for logical topology in IP-over-WDM optical networks against node failure.
J. Supercomput., March, 2023

Component Fault Diagnosability of Hierarchical Cubic Networks.
ACM Trans. Design Autom. Electr. Syst., 2023

2022
Strong Reliability of Star Graphs Interconnection Networks.
IEEE Trans. Reliab., 2022

A Pessimistic Fault Diagnosability of Large-Scale Connected Networks via Extra Connectivity.
IEEE Trans. Parallel Distributed Syst., 2022

FFNLFD: Fault Diagnosis of Multiprocessor Systems at Local Node With Fault-Free Neighbors Under PMC Model and MM* Model.
IEEE Trans. Parallel Distributed Syst., 2022

A Fast $f(r, k+1)/k$f(r, k+1)/k-Diagnosis for Interconnection Networks Under MM* Model.
IEEE Trans. Parallel Distributed Syst., 2022

Better Adaptive Malicious Users Detection Algorithm in Human Contact Networks.
IEEE Trans. Computers, 2022

Subgraph Reliability of Alternating Group Graph With Uniform and Nonuniform Vertex Fault-Free Probabilities.
Comput. J., 2022

2021
An Analysis on the Reliability of the Alternating Group Graph.
IEEE Trans. Reliab., 2021

A Complete Fault Tolerant Method for Extra Fault Diagnosability of Alternating Group Graphs.
IEEE Trans. Reliab., 2021

The <i>t</i>/<i>s</i>-diagnosability and <i>t</i>/<i>s</i>-diagnosis algorithm of folded hypercube under the PMC/MM* model.
Theor. Comput. Sci., 2021

A Novel Measurement for Network Reliability.
IEEE Trans. Computers, 2021

Anonymizing Global Edge Weighted Social Network Graphs.
Proceedings of the Security and Privacy in Social Networks and Big Data, 2021

2020
Restricted connectivity and good-neighbor diagnosability of split-star networks.
Theor. Comput. Sci., 2020

A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model.
Theor. Comput. Sci., 2020

The g-good-neighbour conditional diagnosability of enhanced hypercube under PMC model.
Int. J. Parallel Emergent Distributed Syst., 2020

The extra connectivity of enhanced hypercubes.
Int. J. Parallel Emergent Distributed Syst., 2020

Influence maximization based on activity degree in mobile social networks.
Concurr. Comput. Pract. Exp., 2020

{1, 2, 3}-Restricted Connectivity of $(n, k)$-Enhanced Hypercubes.
Comput. J., 2020

2019
Extra diagnosability and good-neighbor diagnosability of <i>n</i>-dimensional alternating group graph <i>AG</i><sub><i>n</i></sub> under the PMC model.
Theor. Comput. Sci., 2019

On exploiting priority relation graph for reliable multi-path communication in mobile social networks.
Inf. Sci., 2019

The (t, k)-diagnosability of shuffle-cubes under PMC model.
Int. J. Comput. Math. Comput. Syst. Theory, 2019

The Conditional Diagnosability with g-Good-Neighbor of Exchanged Hypercubes.
Comput. J., 2019

Component Reliability Evaluation on Split-Stars.
IEEE Access, 2019

Minimum Neighborhood of Alternating Group Graphs.
IEEE Access, 2019

2018
On the reliability of alternating group graph-based networks.
Theor. Comput. Sci., 2018

The (t, k) -Diagnosability of Balanced Hypercube under the PMC Model.
Int. J. Comput. Math. Comput. Syst. Theory, 2018


  Loading...