个人简介

广东财经大学统计与数学学院教授。广东省千百十人才工程省级培养对象。

张赞波的研究方向是图论及其算法,组合优化和图计算。在图论方面,研究兴趣包括图的匹配问题、图划分问题和有向图的路圈问题;在图算法和图计算方面,主要研究图与超图划分问题的可近似性和近似算法设计,大规模图的并行算法。迄今,发表图论与算法方向的论文近30篇,包括在组合数学著名期刊《SIAM Journal on Discrete Mathematics》发表论文两篇,在图论著名期刊《Journal of Graph Theory》发表论文一篇。

取得的重要结果包括:

图的匹配理论方面:提出并证明了图的匹配扩展理论中两个重要图类的等价条件;证明了匹配可扩性与有向图连通性的等价关系;以及研究了匹配可扩性的极值条件等。

有向图方面:证明了有向图中存在长圈、任意长度的圈或任意长度的路的一系列充分条件;改进了具有30多年历史的有向哈密顿圈存在性的Woodall条件;有向图路可扩性的一系列度条件和竞赛图的路可扩性;二部竞赛图的圈可扩性与哈密顿性的等价关系。

图算法和图计算:在具有大数据管理和分析应用背景的图与超图划分问题的算法设计和复杂度分析方面取得一系列成果,包括基于半定规划的图最大割算法设计,染色图的圈和团划分问题的复杂度分析和算法设计,以及图的最大独立三角形集的判定条件等;近期从事超级计算机上大规模图的并行算法研究。

主持广东省自然科学基金项目“有向图的Hamilton问题和因子问题”(2016A030313829)和“对集交错圈与对集扩展的若干问题”(9451030007003340)。作为第一参与人参与国家自然科学基金项目“反推数学及相关可计算性理论问题”(11471342)。作为第二参与人参与广东省自然科学基金项目“基于NPLS-样条函数的智能传感器自校正建模方法研究(S2012040007521)”。作为第二参与人参与参与广州市科技计划项目“物联网室内微环境监测技术研究”。

为《Discrete Applied Mathematics》,《Graphs and Combinatorics》,《Frontiers of Mathematics in China》和《Ars Combinatorics》等国际期刊审稿。并获美国数学会《数学评论》和欧洲《数学文摘》邀请成为其评论员。多次应邀往国内外大学访问和演讲。

教育背景

2014.1-2017.9, 荷兰特文特大学(University of Twente),博士

2004.9-2008.6,中山大学计算机科学系,博士

1998.9-2001.6,中山大学软件研究所,硕士

1993.9-1997.6,中山大学计算机科学系,学士

工作经历

2019.11-今,广东财经大学,教授。

2004.08-2019.11,广东轻工职业技术学院计算机工程系/信息技术学院,讲师,副教授,教授

2001.08-2004.08,广东北电研发中心,软件工程师,系统维护和支持

1997.07-1998.08,中山大学软件研究所,软件工程师

主要荣誉

广东省“千百十工程”省级培养对象

教学信息

本科课程

线性代数,离散数学

高职高专课程。

数据结构,C程序设计,C#程序设计,C#应用开发,Java程序设计,Java应用开发,SQL Server,项目开发指导

博士/硕士专业课

自动数据采集,极图理论,算法图论,匹配理论,大数据算法,并行算法,并行图论算法

研究兴趣

图论及其算法 , 组合优化

论文列表

1. X. Zhang, R. Ma, J. Sun, & Z. B. Zhang(张赞波,通讯)(2020). Randomized selection algorithm for online stochastic unrelated machines scheduling. Journal of Combinatorial Optimization, 1-16.

2. L. Wang, Y. Shi, Z. Zhang, Z. B. Zhang(张赞波)& Zhang, X. (2020). Approximation algorithm for a generalized Roman domination problem in unit ball graphs. Journal of Combinatorial Optimization, 39(1), 138-148.

3. Z. Zhang(张赞波), Z. Chen. Length of cycles in generalized Petersen graphs. Acta Mathematics Universitatis Comenianae 88 (2019) 1093-1100.

4. J. Liang, B. Zeng, Q. Liu, Z. Zhang(张赞波,通讯), N. Nie. An improved algorithm based on KNN and random forest, In Proceedings of the 3rd International Conference on Computer Science and Application Engineering (2019). ACM.

5. Zan-Bo Zhang(张赞波), X. Zhang, H. Broersma and D. Lou. Extremal and degree conditions for path extendability in digraphs. Siam Journal on Discrete Mathematics 31.3 (2017) 1990-2014(SCI).

6. 唐彩虹, 张赞波. 激光遥感图像乘性噪声降噪技术. 现代电子技术, 2017, 40(20), 98-100.

7. J. Liang, D. Lou, and Zan-Bo Zhang(张赞波). A polynomial time algorithm for cyclic vertex connectivity of cubic graphs. International Journal of Computer Mathematics (SCI), 94-7 (2017) 1501-1514.

8. X. Zhang, Zan-Bo Zhang (张赞波,通讯作者), H. Broersma and X. Wen. On the complexity of edge-colored subgraph partitioning problems in network optimization. Discrete Mathematics & Theoretical Computer Science (SCI), 17-3 (2016), 227-244.

9. 陈燕升, 张赞波等, 一种优化的可能性测度计算树逻辑检测模型, 《中山大学学报(自然科学版)》, 2015, 54(4), 49-54.

10. 陈燕升, 张赞波等, 改进的最小链接负载均衡调度算法, 《计算机系统应用》, 2015, 24(7), 88-92.

11. Z. Gan, D. Lou, Zan-Bo Zhang(张赞波), X. Wen. Bipartite double cover and perfect 2-matching covered graph with its algorithm. Frontiers of Mathematics in China 10 (2015): 621-634 (SCI).

12. B. Xu, X. Yu, X. Zhang and Zan-Bo Zhang (张赞波). An SDP approximation algorithm for max hypergraph cut with limited unbalance. Science China Mathematics 57 (2014), 2437-2462 (SCI). (该论文作者名按姓氏排序。)

13. Zan-Bo Zhang (张赞波), X. Zhang. Triangle strings: structures for augmentation of vertex disjoint triangle sets. Information Processing Letter 114 (2014), 450-456 (SCI).

14. Zan-Bo Zhang (张赞波), X. Zhang and X. Wen. Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs. Siam Journal on Discrete Mathematics 27 (2013) 274-289 (SCI).

15. 李均豪, 张赞波等, 代谢反应网络可视化系统的力导向布局算法设计, 《计算机仿真》2012, 29 (11), 47-50, 94. 参加2012年9月举行的第十二届中国虚拟现实大会.

16. Zan-Bo Zhang (张赞波), X. Zhang, D. Lou and X. Wen. Minimum size of n-factor-critical graphs and k-extendable graphs. Graphs and Combinatorics 28(2012) 433-448 (SCI).

17. X. Wen, Zan-Bo Zhang (张赞波) and D. Lou, M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivity. Discrete Mathematics 311(2011) 817-826 (SCI).

18. X. Zhang, Zan-Bo Zhang (张赞波, 通讯作者), X. Lu and J. Li. Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility. Ars Combinatoria 95(2010) 437-444 (SCI).

19. Zan-Bo Zhang (张赞波), Y. Li and D. Lou. M-alternating Hamilton paths and M-alternating Hamilton cycles. Discrete Mathematics 309 (2009) 3385-3392 (SCI).

20. X. Wen, Z. Yang and Zan-Bo Zhang (张赞波). Construction characterizations for defect n-extendable bipartite graphs. AKCE Journal of Graphs and Combinatorics 6 (2009) 353-360.

21. Q.-M. Wang, Y. Tang and Zan-Bo Zhang (张赞波). Research in Enterprise Applications of Dynamic Web Service Composition Methods and Models. In ISECS '09: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01, 146-150, IEEE Computer Society, Washington, DC, USA, 2009 (EI).

22. Zan-Bo Zhang (张赞波), D. Lou. Notes on bipartite graphs with a perfect matching and digraphs. Advances and Applications in Discrete Mathematics 3 (2009) 87-96.

23. Zan-Bo Zhang (张赞波), D. Lou and X. Zhang. Notes on factor-criticality, extendibility and independence number. Ars Combinatoria 87 (2008) 139-146 (SCI).

24. Zhang X., Wang C., Sun Z. and Zhang Zanbo (张赞波). A new Image encryption scheme based on two-dimensional CA joint with CWQ method. 南京师大学报 (自然科学版), 第31卷第1期, 1-7, 2008.3.

25. Zan-Bo Zhang (张赞波), T. Wang and D. Lou. Equivalence between extendibility and factor-criticality. Ars Combinatoria 85(2007) 279-285 (SCI).

26. 邵亮, 李磊, 张赞波. 评估无级电话网选路方案的一个解析模型. 通信学报, 第24卷第2期, 38-44, 2003.2 (EI).

Biography

Introduction

Education

Ph.D. in Applied Mathematics, University of Twente, the Netherlands, September

2017, advised by Professor Hajo Broersma. Doctoral Thesis: Paths, Cycles and

Related Partitioning Problems in Graphs.

Ph.D. in Computer Science, Sun Yat-sen University, China, June 2008, advised by

Professor Dingjun Lou. Doctoral Thesis: Equivalence between k-extendable Graphs

and n-factor-critical Graphs and Their Properties.

M.Eng. in Computer Science, Sun Yat-sen University, China, June 2001.

B.S. in Computer Science, Sun Yat-sen University, China, June 1997.

Work Experience

1997-1998, The Software Research Institute of Sun Yat-sen University, as a software

engineer.

2001-2004, Research and Development Center, Guangdong Nortel Telecommunica-

tions Equipment Co., Ltd (A key joint venture of Nortel Networks, Canada).

- 2001.7-2003.3, as a software engineer and technical support engineer.

- 2003.4-2004.8, as the global technical support team leader.

2004-2019, Guangdong Industry Polytechnic, as a lecturer, an associate professor, and a professor.

2019-now, Guangdong University of Finance and Economics, as a professor.

Honor

Academic Activities

Teaching

CONTACT BY SCHOLAT
You can communicate with other scholars through Inbox , and you can also communicate by Instant Messaging .
http://www.scholat.com/eltonzhang
21 Luntou Road, Guangzhou 510320
SCAN the QR Code
Visit My Homepage
SCHOLAT.com 学者网
ABOUT US | SCHOLAT