arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.08703cs.DM
收藏

最大公共子图问题的改进动力学

Improved Dynamics for the Maximum Common Subgraph Problem

Davide Guidobene, Guido Cera

AI总结:

针对NP完全的最大公共子图问题,提出两种启发式方法:基于Motzkin-Straus定理的退火模仿动力学和缩减图规模的策略,两者结合在随机Erdős-Rényi图上实现了更快且接近最优的求解。

摘要:

最大公共子图(MCS)问题在各个领域发挥着关键作用,连接了生物信息学和社交网络分析等领域的理论探索与实际应用。尽管其适用性广泛,MCS却极具挑战性,并被归类为NP完全(NPC)问题。本研究引入了新的启发式方法,旨在通过将MCS问题重新表述为最大团及其补集最大独立集来缓解这些挑战。我们的第一个启发式方法利用Motzkin-Straus定理将最大团问题重新表述为约束优化问题,延续了Pelillo在《复制器方程、极大团与图同构》(1999)中使用复制器动力学的工作,并引入了《主导集与层次聚类》(Pavan和Pelillo,2003)中的退火模仿启发式方法,以提高收敛到更优局部最优解的机会。第二种技术应用了借鉴最大独立集问题策略的启发式方法,以高效缩减图规模,正如Akiwa和Iwata在2014年所使用的。这使得计算更快,并且在许多情况下能产生接近最优的解。此外,我们研究了将两种技术实现在单个算法中,发现这是一种很有前景的方法。我们的技术在随机生成的Erdős-Rényi图对上进行了测试。结果表明了其在未来研究方向上的应用潜力与重大影响。

英文摘要:

The Maximum Common Subgraph (MCS) problem plays a crucial role across various domains, bridging theoretical exploration and practical applications in fields like bioinformatics and social network analysis. Despite its wide applicability, MCS is notoriously challenging and is classified as an NP-Complete (NPC) problem. This study introduces new heuristics aimed at mitigating these challenges through the reformulation of the MCS problem as the Maximum Clique and its complement, the Maximum Independent Set. Our first heuristic leverages the Motzkin-Straus theorem to reformulate the Maximum Clique Problem as a constrained optimization problem, continuing the work of Pelillo in Replicator Equations, Maximal Cliques, and Graph Isomorphism (1999) with replicator dynamics and introducing annealed imitation heuristics as in Dominant Sets and Hierarchical Clustering (Pavan and Pelillo, 2003) to improve chances of convergence to better local optima. The second technique applies heuristics drawn upon strategies for the Maximum Independent Set problem to efficiently reduce graph sizes as used by Akiwa and Iwata in 2014. This enables faster computation and, in many instances, yields near-optimal solutions. Furthermore we look at the implementation of both techniques in a single algorithm and find that it is a promising approach. Our techniques were tested on randomly generated Erdős-Rényi graph pairs. Results indicate the potential for application and substantial impact on future research directions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑