Shurong Zhang

Orcid: 0000-0002-0452-7761

According to our database1, Shurong Zhang authored at least 30 papers between 2011 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Effects of Multi-Growth Periods UAV Images on Classifying Karst Wetland Vegetation Communities Using Object-Based Optimization Stacking Algorithm.
Remote. Sens., August, 2023

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

2022
Orthogonal Scattering Model-Based Three-Component Decomposition of Polarimetric SAR Data.
Remote. Sens., 2022

Minsum node-disjoint paths with time-varying delay functions.
Int. J. Parallel Emergent Distributed Syst., 2022

A General Implementation of the Neumann Volume Scattering Model for PolSAR Data.
IEEE Geosci. Remote. Sens. Lett., 2022

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

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

2020
Multi-Seed Group Labeling in RFID Systems.
IEEE Trans. Mob. Comput., 2020

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

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

Edge-bipancyclicity in conditional edge-faulty <i>k</i>-ary <i>n</i>-cubes.
RAIRO Theor. Informatics Appl., 2019

Energy-Efficient Sleep Scheduling in WBANs: From the Perspective of Minimum Dominating Set.
IEEE Internet Things J., 2019

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

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

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

On the spanning connectivity of tournaments.
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

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 hybrid model of sentimental entity recognition on mobile social media.
EURASIP J. Wirel. Commun. Netw., 2016

2015
Fault-Free Hamiltonian Cycles Passing through Prescribed Edges in k-Ary n-Cubes with Faulty Edges.
IEEE Trans. Parallel Distributed Syst., 2015

2014
Hamiltonian path embeddings in conditional faulty k-ary n-cubes.
Inf. Sci., 2014

2013
Many-to-many disjoint path covers in <i>k</i>k-ary <i>n</i>n-cubes.
Theor. Comput. Sci., 2013

2012
Embeddings of hamiltonian paths in faulty <i>k</i>-ary 2-cubes.
Discuss. Math. Graph Theory, 2012

Embedding long cycles in faulty k-ary 2-cubes.
Appl. Math. Comput., 2012

2011
Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults.
Theor. Comput. Sci., 2011


  Loading...