子图同构的深入分析
Deep Analysis on Subgraph Isomorphism
摘要:
子图同构是一个NP难问题,在社会网络分析、知识图谱查询等领域有着广泛的应用。其性能往往受到固有硬度的限制。自2012年以来,已经做了一些有见地的工作,主要是优化剪枝规则和匹配顺序,以加速枚举所有同构子图。然而,他们的正确性和性能没有得到很好的研究。首先,不同的语言在实现中使用不同的编译标志。其次,实验不是在相同的平台和相同的数据集上进行的。第三,不同作品的某些思想甚至是互补的。最后,一些算法在应用时存在误差。在本文中,我们解决这些问题,重新实现7个代表性的子图同构算法,以及它们的改进版本,并进行全面的实验,各种图。结果显示了最先进的解决方案的优点和缺点,并探索了新的优化方法。
英文摘要:
Subgraph isomorphism is a well-known NP-hard problem which is widely used in many applications, such as social network analysis and knowledge graph query. Its performance is often limited by the inherent hardness. Several insightful works have been done since 2012, mainly optimizing pruning rules and matching orders to accelerate enumerating all isomorphic subgraphs. Nevertheless, their correctness and performance are not well studied. First, different languages are used in implementation with different compilation flags. Second, experiments are not done on the same platform and the same datasets. Third, some ideas of different works are even complementary. Last but not least, there exist errors when applying some algorithms. In this paper, we address these problems by re-implementing seven representative subgraph isomorphism algorithms as well as their improved versions, and conducting comprehensive experiments on various graphs. The results show pros and cons of state-of-the-art solutions and explore new approaches to optimization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。