AI RESEARCH
Approximate Subgraph Matching with Neural Graph Representations and Reinforcement Learning
arXiv CS.AI
•
ArXi:2603.18314v1 Announce Type: cross Approximate subgraph matching (ASM) is a task that determines the approximate presence of a given query graph in a large target graph. Being an NP-hard problem, ASM is critical in graph analysis with a myriad of applications ranging from database systems and network science to biochemistry and privacy. Existing techniques often employ heuristic search strategies, which cannot fully utilize the graph information, leading to sub-optimal solutions.