Weihua Yang

Orcid: 0000-0002-7629-0193

According to our database1, Weihua Yang authored at least 135 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The super edge-connectivity of direct product of a graph and a cycle.
J. Supercomput., November, 2024

Calibrate the Inter-Observer Segmentation Uncertainty via Diagnosis-First Principle.
IEEE Trans. Medical Imaging, September, 2024

Reliability analysis of the augmented cubes in terms of the h-extra r-component edge-connectivity.
J. Supercomput., May, 2024

On modified l-embedded edge-connectivity of enhanced hypercubes.
J. Supercomput., May, 2024

Counterexamples to Gerbner's conjecture on stability of maximal F-free graphs.
J. Graph Theory, February, 2024

A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs.
SIAM J. Discret. Math., 2024

Altered static and dynamic functional brain network in knee osteoarthritis: A resting-state functional magnetic resonance imaging study.
NeuroImage, 2024

Vessel-promoted OCT to OCTA image translation by heuristic contextual constraints.
Medical Image Anal., 2024

The maximum number of edges in a K<sub>r+1</sub>, M<sub>k+1</sub>-free graph.
Discuss. Math. Graph Theory, 2024

Decomposition of the line graph of the complete graph into stars.
Discret. Math., 2024

The structure of minimally t-tough, 2K2-free graphs.
Discret. Appl. Math., 2024

Conditional k-matching preclusion for n-dimensional torus networks.
Discret. Appl. Math., 2024

Voronoi-based adaptive area optimal coverage control for multiple manipulator systems with uncertain kinematics and dynamics.
Commun. Nonlinear Sci. Numer. Simul., 2024

Meet in the air: Distributed neighbor discovery in 3D networks with directional transceivers.
Comput. Networks, 2024

Pancyclic And Hamiltonian Properties Of Dragonfly Networks.
Comput. J., 2024

A new segmentation algorithm for peripapillary atrophy and optic disk from ultra-widefield Photographs.
Comput. Biol. Medicine, 2024

2023
Belief Propagation for Unbalanced Assignment Problem.
Asia Pac. J. Oper. Res., December, 2023

Learning to solve graph metric dimension problem based on graph contrastive learning.
Appl. Intell., December, 2023

The disjoint path cover in the data center network HSDC with prescribed vertices in each path.
Appl. Math. Comput., December, 2023

Structural diagnosability of hypercubes under the PMC and MM* models.
Theor. Comput. Sci., November, 2023

A Note on the Mixing Factor of Polar Codes.
Entropy, November, 2023

On The Maximum Cliques Of The Subgraphs Induced By Binary Constant Weight Codes In Powers Of Hypercubes.
Comput. J., October, 2023

On regular 2-connected 2-path Hamiltonian graphs.
Discret. Math., August, 2023

On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs.
Discret. Math., June, 2023

A multi-modal fundus image based auxiliary location method of lesion boundary for guiding the layout of laser spot in central serous chorioretinopathy therapy.
Comput. Biol. Medicine, March, 2023

Automated detection of myopic maculopathy using five-category models based on vision outlooker for visual recognition.
Frontiers Comput. Neurosci., February, 2023

Hybrid Fault Diagnosis Capability Analysis of Highly Connected Graphs.
Comput. J., January, 2023

3D Non-Synchronous Measurements With Central Reference Based on Revolution and Autorotation of Spherical Microphone Array.
IEEE Signal Process. Lett., 2023

High-Resolution Fast-Rotating Sound Localization Based on Modal Composition Beamforming and Bayesian Inversion.
IEEE Signal Process. Lett., 2023

The routing algorithms for maximum probability paths under degree constraints in networks.
Int. J. Parallel Emergent Distributed Syst., 2023

Automatic Diagnosis of Different Types of Retinal Vein Occlusion Based on Fundus Images.
Int. J. Intell. Syst., 2023

A characterization of internally 4-connected {P<sub>10</sub> - {V<sub>1</sub>, V<sub>2</sub>}}-minor-free graphs.
Discuss. Math. Graph Theory, 2023

2022
Charging Path Optimization in Mobile Networks.
IEEE/ACM Trans. Netw., 2022

Periodic Communities Mining in Temporal Networks: Concepts and Algorithms.
IEEE Trans. Knowl. Data Eng., 2022

The Sufficient Conditions of (δ(G) - 2)-(|F|-)Fault-Tolerant Maximal Local-(Edge-)Connectivity of Connected Graphs.
J. Interconnect. Networks, 2022

A Note on Oct1+-Minor-Free Graphs and Oct2+-Minor-Free Graphs.
J. Interconnect. Networks, 2022

A stability theorem for maximal C 2 k + 1 ${C}_{2k+1}$ -free graphs.
J. Graph Theory, 2022

On Generalized Turán Number of Two Disjoint Cliques.
Graphs Comb., 2022

Classification of dry and wet macular degeneration based on the ConvNeXT model.
Frontiers Comput. Neurosci., 2022

Construction of several classes of maximum codes.
Discret. Math. Algorithms Appl., 2022

Multi-rater Prism: Learning self-calibrated medical image segmentation from multiple raters.
CoRR, 2022

Calibrate the inter-observer segmentation uncertainty via diagnosis-first principle.
CoRR, 2022

The Component Diagnosability of Hypercubes with Large-Scale Faulty Nodes.
Comput. J., 2022

An intelligent location method of key boundary points for assisting the diameter measurement of central serous chorioretinopathy lesion area.
Comput. Biol. Medicine, 2022

Learning to compute the metric dimension of graphs.
Appl. Math. Comput., 2022

2021
Contractible Edges in 3-Connected Cubic Graphs.
Parallel Process. Lett., 2021

Reliability analysis of the augmented cubes in terms of the extra edge-connectivity and the component edge-connectivity.
J. Parallel Distributed Comput., 2021

The g-Extra Edge-Connectivity of Balanced Hypercubes.
J. Interconnect. Networks, 2021

Maintaining Constrained Path Problem for Directed Acyclic Graphs.
J. Interconnect. Networks, 2021

Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs.
J. Comput. Syst. Sci., 2021

The clique distribution in powers of hypercubes.
Discret. Appl. Math., 2021

Conditional fractional matching preclusion of n-dimensional torus networks.
Discret. Appl. Math., 2021

A Novel Meibomian Gland Morphology Analytic System Based on a Convolutional Neural Network.
IEEE Access, 2021

Scaling Up Distance-generalized Core Decomposition.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
Reliability analysis of subsystem in dual cubes.
Theor. Comput. Sci., 2020

Ordering Heuristics for k-clique Listing.
Proc. VLDB Endow., 2020

Reliability Analysis of the Generalized Exchanged Hypercube.
Parallel Process. Lett., 2020

Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes.
Parallel Process. Lett., 2020

5-Shredders of Contraction-Critical 5-Connected Graphs.
Parallel Process. Lett., 2020

A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks.
Parallel Process. Lett., 2020

Preface.
Parallel Process. Lett., 2020

Component connectivity of Cayley graphs generated by transposition trees.
Int. J. Parallel Emergent Distributed Syst., 2020

Embedding planar 5-graphs in three pages.
Discret. Appl. Math., 2020

Maximizing the number of cliques in graphs with given matching number.
Discret. Appl. Math., 2020

Scaling Up Distanced-generalized Core Decomposition.
CoRR, 2020

Weakly supervised detection of central serous chorioretinopathy based on local binary patterns and discrete wavelet transform.
Comput. Biol. Medicine, 2020

Knowledge-based Deep Reinforcement Learning for Train Automatic Stop Control of High-Speed Railway.
Proceedings of the MLMI 2020: The 3rd International Conference on Machine Learning and Machine Intelligence, 2020

2019
Structure fault tolerance of <i>k</i>-ary <i>n</i>-cube networks.
Theor. Comput. Sci., 2019

The Generalized Connectivity of Data Center Networks.
Parallel Process. Lett., 2019

Matching Preclusion for Enhanced Pyramid Networks.
J. Interconnect. Networks, 2019

Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions.
Int. J. Found. Comput. Sci., 2019

Late pregnancy analysis with Yunban's remote fetal monitoring system.
Int. J. Distributed Sens. Networks, 2019

Conditional connectivity of folded hypercubes.
Discret. Appl. Math., 2019

The Turán number for spanning linear forests.
Discret. Appl. Math., 2019

Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM∗ model of a graph.
Discret. Appl. Math., 2019

Automatic cataract grading methods based on deep learning.
Comput. Methods Programs Biomed., 2019

Anti-<i>k</i>-labeling of graphs.
Appl. Math. Comput., 2019

Minimum degree and size conditions for the proper connection number of graphs.
Appl. Math. Comput., 2019

The (<i>d</i>, 1)-total labelling of Sierpin'ski-like graphs.
Appl. Math. Comput., 2019

2018
Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks.
Parallel Process. Lett., 2018

A Remark on Rainbow 6-Cycles in Hypercubes.
Parallel Process. Lett., 2018

On 3-Regular Subgraphs in Cartesian Product of Paths.
J. Interconnect. Networks, 2018

Component Edge Connectivity of Hypercubes.
Int. J. Found. Comput. Sci., 2018

A conditional edge connectivity of double-orbit networks.
Future Gener. Comput. Syst., 2018

Making a dominating set of a graph connected.
Discuss. Math. Graph Theory, 2018

On the spanning connectivity of tournaments.
Discret. Appl. Math., 2018

A kind of conditional connectivity of transposition networks generated by k-trees.
Discret. Appl. Math., 2018

Number of proper paths in edge-colored hypercubes.
Appl. Math. Comput., 2018

2017
On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks.
Theor. Comput. Sci., 2017

Strong Menger connectivity with conditional faults of folded hypercubes.
Inf. Process. Lett., 2017

Hamiltonian paths in spanning subgraphs of line graphs.
Discret. Math., 2017

Supereulerian graphs and Chvatal-Erdos type conditions.
Ars Comb., 2017

Edge disjoint paths in hypercubes and folded hypercubes with conditional faults.
Appl. Math. Comput., 2017

The generalized 3-connectivity of graph products.
Appl. Math. Comput., 2017

2016
Component connectivity of hypercubes.
Theor. Comput. Sci., 2016

The <i>g</i>-extra conditional diagnosability and sequential <i>t/k</i>-diagnosability of hypercubes.
Int. J. Comput. Math., 2016

A Note on Edge-Disjoint Hamilton Cycles in Line Graphs.
Graphs Comb., 2016

Hamiltonian cycles in spanning subgraphs of line graphs.
Discret. Appl. Math., 2016

On total domination number of Cartesian product of directed cycles.
Ars Comb., 2016

2015
Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees.
Int. J. Comput. Math., 2015

On cyclic edge connectivity of regular graphs with two orbits.
Ars Comb., 2015

A note on the graphs with given small matching number.
Ars Comb., 2015

λ'-optimal regular graphs with two orbits.
Ars Comb., 2015

A kind of conditional vertex connectivity of recursive circulants.
Ars Comb., 2015

2014
Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity.
IEEE Trans. Computers, 2014

Reliability analysis of bijective connection networks in terms of the extra edge-connectivity.
Inf. Sci., 2014

On reliability of the folded hypercubes in terms of the extra edge-connectivity.
Inf. Sci., 2014

Collapsible Graphs and Hamiltonicity of Line Graphs.
Graphs Comb., 2014

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree.
Discret. Appl. Math., 2014

Strongly self-centered orientation of complete k-partite graphs.
Discret. Appl. Math., 2014

Extraconnectivity of Folded Hypercubes.
Ars Comb., 2014

2013
Supereulerian graphs, Hamiltonicity of graphes and several extremal problems in graphs. (Graphes super-eulériens, problèmes hamiltonicité et extrémaux dans les graphes).
PhD thesis, 2013

Bounding the size of the subgraph induced by <i>m</i>m vertices and extra edge-connectivity of hypercubes.
Discret. Appl. Math., 2013

Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs.
Appl. Math. Lett., 2013

On the t/k-diagnosability of BC networks.
Appl. Math. Comput., 2013

2012
Distance spectral radius of digraphs with given connectivity.
Discret. Math., 2012

Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees.
Discret. Math., 2012

Every 3-connected essentially 10-connected line graph is Hamilton-connected.
Discret. Math., 2012

A note on collapsible graphs and super-Eulerian graphs.
Discret. Math., 2012

Collapsible graphs and Hamiltonian connectedness of line graphs.
Discret. Appl. Math., 2012

Hamiltonicity of 3-connected line graphs.
Appl. Math. Lett., 2012

Generalized measures of fault tolerance in hypercube networks.
Appl. Math. Lett., 2012

Super restricted edge connectivity of regular graphs with two orbits.
Appl. Math. Comput., 2012

2011
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees.
Inf. Sci., 2011

On super 2-restricted and 3-restricted edge-connected vertex transitive graphs.
Discret. Math., 2011

On the edge-connectivity of graphs with two orbits of the same size.
Discret. Math., 2011

Outerplanarity of line graphs and iterated line graphs.
Appl. Math. Lett., 2011

On a kind of reliability analysis of networks.
Appl. Math. Comput., 2011

2010
A kind of conditional fault tolerance of alternating group graphs.
Inf. Process. Lett., 2010

Conditional connectivity of Cayley graphs generated by transposition trees.
Inf. Process. Lett., 2010

A kind of conditional fault tolerance of (n, k)-star graphs.
Inf. Process. Lett., 2010

Extraconnectivity of Cartesian product graphs of paths.
Ars Comb., 2010

Extraconnectivity of hypercubes (II).
Australas. J Comb., 2010

2009
Embedding connected double-loop networks with even cardinality in books.
Appl. Math. Lett., 2009

Extraconnectivity of hypercubes.
Appl. Math. Lett., 2009


  Loading...