default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuowei Dai 0002
Person information
- affiliation: Nanjing Normal University, Institute of Mathematics and School of Mathematical Science, China
- affiliation (PhD 2020): Central China Normal University, Faculty of Mathematics and Statistics, Wuhan, Hubei, China
Other persons with the same name
- Guowei Dai (aka: Guo-Wei Dai) — disambiguation page
- Guowei Dai 0001
![[0000-0003-0054-0392]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-0054-0392")
— Sichuan University, College of Computer Science and the National Key Laboratory of Fundamental Science on Synthetic Vision, Chengdu, China (and 1 more) - Guowei Dai 0003 — Nanjing Forestry University (NJFU), College of Science, Jiangsu, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Guowei Dai, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang, Zan-Bo Zhang:
Convergence and correctness of belief propagation for weighted min-max flow. Discret. Appl. Math. 354: 122-130 (2024)- [j13]Ting Jin, Tongtong Hu, Guowei Dai, Kunqi Su, Shijun Xiao:
On graph-based network parameters and component factors in networks. RAIRO Oper. Res. 58(4): 3337-3346 (2024) - 2023
- [j12]Guowei Dai:
The existence of path-factor covered graphs. Discuss. Math. Graph Theory 43(1): 5-16 (2023) - [j11]Guowei Dai, Yannan Chen, Yaping Mao, Dachuan Xu, Xiaoyan Zhang, Zan-Bo Zhang:
A distributed message passing algorithm for computing perfect demand matching. J. Parallel Distributed Comput. 179: 104706 (2023) - 2022
- [j10]Yuan Chen, Guowei Dai:
Binding number and path-factor critical deleted graphs. AKCE Int. J. Graphs Comb. 19(3): 197-200 (2022) - [j9]Guowei Dai, Yuefang Sun, Xiaoyan Zhang, Yan Zhao:
A distributed message passing algorithm for the capacitated directed Chinese postman problem. Comput. Electr. Eng. 99: 107755 (2022) - [j8]Guowei Dai, Zan-Bo Zhang, Hajo Broersma, Xiaoyan Zhang:
The Hamiltonian properties in K1, r-free split graphs. Discret. Math. 345(6): 112826 (2022) - [j7]Guowei Dai:
Remarks on component factors in graphs. RAIRO Oper. Res. 56(2): 721-730 (2022) - [j6]Guowei Dai, Yicheng Hang, Xiaoyan Zhang, Zan-Bo Zhang, Wenqi Wang:
Sufficient conditions for graphs with {P2, P5}-factors. RAIRO Oper. Res. 56(4): 2895-2901 (2022) - [j5]Guowei Dai:
On 2-matching covered graphs and 2-matching deleted graphs. RAIRO Oper. Res. 56(5): 3667-3674 (2022) - [j4]Guowei Dai, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang, Zan-Bo Zhang:
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths. IEEE Trans. Inf. Theory 68(6): 3870-3878 (2022) - 2021
- [j3]Guowei Dai, Zan-Bo Zhang, Yicheng Hang, Xiaoyan Zhang:
Some degree conditions for 𝒫≥k-factor covered graphs. RAIRO Oper. Res. 55(5): 2907-2913 (2021) - 2020
- [j2]Guowei Dai, Zhiquan Hu:
P3-Factors in the Square of a Tree. Graphs Comb. 36(6): 1913-1925 (2020)
2010 – 2019
- 2019
- [j1]Guowei Dai, Fengwei Li, Yuefang Sun, Dachuan Xu, Xiaoyan Zhang:
Convergence and correctness of belief propagation for the Chinese postman problem. J. Glob. Optim. 75(3): 813-831 (2019)
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 2025-12-03 00:30 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:
