default search action
Zan-Bo Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Yan Zhao, Zan-Bo Zhang, Xiaoyan Zhang:
A survey on rainbow (vertex-)index of graphs. Discret. Appl. Math. 349: 96-105 (2024) - [j26]Jun Liang
, Xinyao Liu, Dingjun Lou, Zan-Bo Zhang, Zixin Qin:
Cyclic edge and cyclic vertex connectivity of (4,5,6)-fullerene graphs. Discret. Appl. Math. 351: 94-104 (2024) - [j25]Guowei Dai
Convergence and correctness of belief propagation for weighted min-max flow. Discret. Appl. Math. 354: 122-130 (2024) - 2023
- [j24]Qi Zhang
A parallel PageRank algorithm for undirected graph. Appl. Math. Comput. 459: 128276 (2023) - [j23]Jian Sun, Zan-Bo Zhang, Yannan Chen, Deren Han, Donglei Du, Xiaoyan Zhang
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis. J. Glob. Optim. 87(2): 917-937 (2023) - [j22]Guowei Dai, Yannan Chen, Yaping Mao
A distributed message passing algorithm for computing perfect demand matching. J. Parallel Distributed Comput. 179: 104706 (2023) - [j21]Guowei Dai
Remarks on component factors in K1,r-free graphs. RAIRO Oper. Res. 57(2): 837-846 (2023) - [c2]Sha-Sha Zhang, Ai-Xiang Chen, Zan-Bo Zhang:
Fine-Tuned Heterogeneous Graph Convolutional Network Embedding. ICMLC 2023: 358-364 - 2022
- [j20]Guowei Dai
The Hamiltonian properties in K1, r-free split graphs. Discret. Math. 345(6): 112826 (2022) - [j19]Xiaoyan Zhang, Ran Ma, Jian Sun, Zan-Bo Zhang:
Randomized selection algorithm for online stochastic unrelated machines scheduling. J. Comb. Optim. 44(3): 1796-1811 (2022) - [j18]Guowei Dai
Sufficient conditions for graphs with {P2, P5}-factors. RAIRO Oper. Res. 56(4): 2895-2901 (2022) - [j17]Guowei Dai
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths. IEEE Trans. Inf. Theory 68(6): 3870-3878 (2022) - 2021
- [j16]Jun Liang
The cubic graphs with finite cyclic vertex connectivity larger than girth. Discret. Math. 344(2): 112197 (2021) - [j15]Zan-Bo Zhang, Xiaoyan Zhang
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments. J. Graph Theory 96(2): 171-191 (2021) - [j14]Guowei Dai
Some degree conditions for 𝒫≥k-factor covered graphs. RAIRO Oper. Res. 55(5): 2907-2913 (2021) - 2020
- [j13]Jiangdong Ai, Hui Lei, Yongtang Shi
k-Ary spanning trees contained in tournaments. Discret. Appl. Math. 285: 141-146 (2020) - [j12]Limin Wang, Yalin Shi, Zhao Zhang, Zan-Bo Zhang, Xiaoyan Zhang
Approximation algorithm for a generalized Roman domination problem in unit ball graphs. J. Comb. Optim. 39(1): 138-148 (2020)
2010 – 2019
- 2019
- [c1]Jun Liang
An Improved Algorithm based on KNN and Random Forest. CSAE 2019: 74:1-74:6 - 2017
- [j11]Jun Liang
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs. Int. J. Comput. Math. 94(7): 1501-1514 (2017) - [j10]Zan-Bo Zhang, Xiaoyan Zhang, Hajo Broersma
Extremal and Degree Conditions for Path Extendability in Digraphs. SIAM J. Discret. Math. 31(3): 1990-2014 (2017) - 2016
- [j9]Xiaoyan Zhang, Zan-Bo Zhang, Hajo Broersma
On the complexity of edge-colored subgraph partitioning problems in network optimization. Discret. Math. Theor. Comput. Sci. 17(3): 227-244 (2016) - 2014
- [j8]Zan-Bo Zhang, Xiaoyan Zhang:
Triangle strings: Structures for augmentation of vertex-disjoint triangle sets. Inf. Process. Lett. 114(8): 450-456 (2014) - 2013
- [j7]Zan-Bo Zhang, Xiaoyan Zhang, Xuelian Wen:
Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs. SIAM J. Discret. Math. 27(1): 274-289 (2013) - 2012
- [j6]Zan-Bo Zhang, Xiaoyan Zhang, Dingjun Lou, Xuelian Wen:
Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs. Graphs Comb. 28(3): 433-448 (2012) - 2011
- [j5]Xuelian Wen, Zan-Bo Zhang, Dingjun Lou:
M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities. Discret. Math. 311(10-11): 817-826 (2011) - 2010
- [j4]Xiaoyan Zhang, Zan-Bo Zhang, Xiaoxu Lu, Jing Li:
Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility. Ars Comb. 95 (2010)
2000 – 2009
- 2009
- [j3]Zan-Bo Zhang, Yueping Li, Dingjun Lou:
M-alternating Hamilton paths and M-alternating Hamilton cycles. Discret. Math. 309(10): 3385-3392 (2009) - 2008
- [j2]Zan-Bo Zhang, Dingjun Lou, Xiaoyan Zhang:
Notes on factor-critically, extendability and independence number. Ars Comb. 87 (2008) - 2007
- [j1]Zan-Bo Zhang, Tao Wang, Dingjun Lou:
Equivalence between Extendability and Factor-Criticality. Ars Comb. 85 (2007)
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 2024-08-23 19:25 CEST 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: