Journal of Computer Applications ›› 2021, Vol. 41 ›› Issue (6): 1756-1760.DOI: 10.11772/j.issn.1001-9081.2020091381

Special Issue: 先进计算

• Advanced computing • Previous Articles     Next Articles

Maximum common induced subgraph algorithm based on vertex conflict learning

WANG Yu1, LIU Yanli1,2, CHEN Shaowu1   

  1. 1. College of Science, Wuhan University of Science and Technology, Wuhan Hubei 430081, China;
    2. Hubei Province Key Laboratory of Systems Science in Metallurgical Process(Wuhan University of Science and Technology), Wuhan Hubei 430081, China
  • Received:2020-09-07 Revised:2020-11-02 Online:2021-06-10 Published:2020-11-16
  • Supported by:
    This work is partially supported by the Innovative Training Program for College Students of Hubei (S201910488044), the Open Funds of Hubei Province Key Laboratory of Systems Science in Metallurgical Process (Y201716).


王宇1, 刘燕丽1,2, 陈劭武1   

  1. 1. 武汉科技大学 理学院, 武汉 430081;
    2. 冶金工业过程系统科学湖北省重点实验室(武汉科技大学), 武汉 430081
  • 通讯作者: 刘燕丽
  • 作者简介:王宇(1999-),男,湖北汉川人,主要研究方向:最大公共子图问题;刘燕丽(1980-),女,河南西平人,副教授,博士,CCF会员,主要研究方向:组合优化问题求解、算法设计;陈劭武(1999-),男,湖北武汉人,主要研究方向:最大公共子图问题。
  • 基金资助:

Abstract: The traditional branching strategies of Maximum Common induced Subgraph (MCS) problem rely on the static properties of graphs and lack learning information about historical searches. In order to solve these problems, a branching strategy based on vertex conflict learning was proposed. Firstly, the reduction value of the upper bound was used as the reward to the branch node for completing a matching action. Secondly, when the optimal solution was updated, the optimal solution obtained actually was the result of continuous inference of the branch nodes. Therefore, the appropriate rewards were given to the branch nodes on the complete search path to strengthen the positive effect of these vertices on search. Finally, the value function of matching action was designed, and the vertices with the maximum cumulative rewards would be selected as new branch nodes. On the basis of Maximum common induced subgraph Split (McSplit) algorithm, an improved McSplit Reinforcement Learning and Routing (McSplitRLR) algorithm combined with the new branching strategy was completed. Experimental results show that, with the same computer and solution time limit, excluding the simple instances solved by all comparison algorithms within 10 seconds, compared to the state-of-the-art algorithms of McSplit and McSplit Solution-Biased Search (McSplitSBS), McSplitRLR solves 109 and 33 more hard instances respectively, and the solution rate increases by 5.6% and 1.6% respectively.

Key words: combinatorial optimization problem, Non-deterministic Polynomial Hard (NP-Hard) problem, reinforcement learning, algorithm design, Maximum Common induced Subgraph (MCS)

摘要: 针对最大公共子图(MCS)的传统分支策略依赖于图的静态属性,缺少学习历史搜索信息的问题,提出了基于顶点冲突学习的分支策略。首先,把上界的减少值作为分支点完成匹配动作的奖励;其次,由于当最优解被更新时,得到的最优解是分支点不断推理产生的结果,因此给予在完整的搜索路径上的分支点适当的奖励,从而强化这些顶点对搜索的积极作用;最后,设计了匹配动作的价值函数,并选择具有最大累计奖励的顶点作为新的分支点。在McSplit算法基础上,提出了糅合新分支策略的McSplitRLR算法。实验结果表明,除去均可以被所有对比算法在10 s之内解决的简单算例,在相同机器和求解限制时间条件下,相较当前先进的算法McSplit、McSplitSBS,McSplitRLR分别多解决了109、33个困难算例,求解率分别提高了5.6%、1.6%。

关键词: 组合优化问题, NP-Hard问题, 强化学习, 算法设计, 最大公共子图

CLC Number: