.png){kind=icon}
返回
PathLAD plus : Towards effective exact methods for subgraph isomorphism problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.artint.2024.104219.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The subgraph isomorphism problem (SIP) is a challenging problem with wide practical applications. In the last decade, despite being a theoretical hard problem, researchers designed various algorithms for solving SIP. In this work, we propose five main strategies and develop an improved exact algorithm for SIP. First, we design a probing search procedure to try whether the search procedure can successfully obtain a solution at first sight. Second, we design a novel matching ordering strategy as a value-ordering heuristic, which uses some useful information obtained from the probing search procedure to preferentially select some promising target vertices. Third, we discuss the characteristics of different propagation methods in the context of SIP and present an adaptive propagation method to make a good balance between these methods. Moreover, to further improve the performance of solving large graphs, we propose an enhanced implementation of the edge constraint method and a domain limitation strategy, which aims to accelerate the search process. Experimental results on a broad range of classic and graph-database benchmarks show that our proposed algorithm performs better than several state-of-the-art algorithms for the SIP.
Keyword:
Optimization
Subgraph isomorphism problem
Exact method
Adaptive propagation method
Large graph
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
Adaptive constraint propagation in constraint satisfaction: review and evaluation约束满足中的自适应约束传播: 回顾与评价
PREAI
分享收藏分享收藏分享收藏分享收藏On the complexity of submap isomorphism and maximum common submap problems.png)
PATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏
查看更多内容