.png){kind=icon}
返回
Fast Subgraph Matching by Dynamic Graph Editing
.png){kind=icon}
PRE
AI
DOI：10.1109/TSC.2023.3333840.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Subgraph matching is a challenging NP-complete problem that involves finding identical subgraphs of a query graph qq in a larger data graph G. It has numerous applications in diverse fields, including social and biological networks. However, existing subgraph matching algorithms assume that the graph structure is fixed, which limits their performance in solving more difficult matching cases. To address this issue, we propose a novel approach called Dynamic Graph Editing (DGE), which dynamically edits the query graph to optimize the subgraph matching algorithm. Based on this approach, we introduce an efficient enumeration method called Dynamic Graph Editing Enumeration, which significantly improves the performance of the algorithm. Our experimental results show that DGE outperforms current state-of-the-art algorithms in terms of computational efficiency and ability to solve more complex subgraph matching cases.
Keyword:
Heuristic algorithms
Optimization
Search problems
Approximation algorithms
Social networking (online)
Pattern matching
Constraint handling
Graph algorithm
subgraph matching
query processing
optimization technique
期刊
IF:
5.8
论文数:
2.2K
被引数:
6.5K
机构
引用论文
.png){kind=icon}
分享收藏Mineralogy and crystal chemistry of Mn, Fe, Co, Ni, and Cu in a deep-sea Pacific polymetallic nodule
OAAI
OAAI分享收藏Seeding alters plant community trajectory: Impacts of seeding, grazing and trampling on semi‐arid re‐vegetation播种改变了植物群落演替轨迹：播种、放牧和践踏对半干旱区植被恢复的影响OAAI
OAAI分享收藏分享收藏
查看更多内容