Subgraph Matching via Query-Conditioned Subgraph Matching Neural Networks and Bi-Level Tree Search. (arXiv:2207.10305v1 [cs.LG])

Recent advances have shown the success of using reinforcement learning and
search to solve NP-hard graph-related tasks, such as Traveling Salesman
Optimization, Graph Edit Distance computation, etc. However, it remains unclear
how one can efficiently and accurately detect the occurrences of a small query
graph in a large target graph, which is a core operation in graph database
search, biomedical analysis, social group finding, etc. This task is called
Subgraph Matching which essentially performs subgraph isomorphism check between
a query …

arxiv bi lg networks neural networks query search tree