Parallel Bounded Search for the Maximum Clique Problem
Hua Jiang(江华)1,2, Member, CCF, Ke Bai(白珂)2, Hai-Jiao Liu(刘海姣)2, Chu-Min Li(李初民)3, Felip Manyà4, and Zhang-Hua Fu(付樟华)5,6, Member, CCF
1Engineering Research Center of Cyberspace, Yunnan University, Kunming 650500, China 2School of Software, Yunnan University, Kunming 650500, China 3Laboratory of Modeling, Information and Systems, University of Picardie Jules Verne, Amiens 80039, France 4Artificial Intelligence Research Institute, Catalonia 08193, Spain 5Shenzhen Institute of Artificial Intelligence and Robotics for Society, Shenzhen 518000, China 6Institute of Robotics and Intelligent Manufacturing, Chinese University of Hong Kong, Shenzhen 518000, China
About author:Hua Jiang received his Ph.D. degree in computer science from Huazhong University of Science and Technology, Wuhan, in 2017. He is an associate professor in the School of Software, Yunnan University, Kunming. He is a professional CCF member and AAAI member. His research interests include the practical algorithm solving for combinatorial optimization problems, algorithms for social network analysis and graph theory.