Guowei Dai

Orcid: 0000-0001-5839-4573

Affiliations:
  • Nanjing Normal University, Institute of Mathematics and School of Mathematical Science, China
  • Central China Normal University, Faculty of Mathematics and Statistics, Wuhan, Hubei, China (PhD 2020)


According to our database1, Guowei Dai authored at least 14 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On graph-based network parameters and component factors in networks.
RAIRO Oper. Res., 2024

Convergence and correctness of belief propagation for weighted min-max flow.
Discret. Appl. Math., 2024

2023
A distributed message passing algorithm for computing perfect demand matching.
J. Parallel Distributed Comput., September, 2023

The existence of path-factor covered graphs.
Discuss. Math. Graph Theory, 2023

2022
On 2-matching covered graphs and 2-matching deleted graphs.
RAIRO Oper. Res., September, 2022

Binding number and path-factor critical deleted graphs.
AKCE Int. J. Graphs Comb., September, 2022

Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths.
IEEE Trans. Inf. Theory, 2022

Sufficient conditions for graphs with {<i>P</i><sub>2</sub>, <i>P</i><sub>5</sub>}-factors.
RAIRO Oper. Res., 2022

Remarks on component factors in graphs.
RAIRO Oper. Res., 2022

The Hamiltonian properties in <i>K</i><sub>1, <i>r</i></sub>-free split graphs.
Discret. Math., 2022

A distributed message passing algorithm for the capacitated directed Chinese postman problem.
Comput. Electr. Eng., 2022

2021
Some degree conditions for 𝒫<sub>≥<i>k</i></sub>-factor covered graphs.
RAIRO Oper. Res., 2021

2020
P<sub>3</sub>-Factors in the Square of a Tree.
Graphs Comb., 2020

2019
Convergence and correctness of belief propagation for the Chinese postman problem.
J. Glob. Optim., 2019


  Loading...