Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching. (arXiv:2201.11251v1 [cs.LG])

Web: http://arxiv.org/abs/2201.11251

Subgraph matching is a fundamental problem in various fields that use graph
structured data. Subgraph matching algorithms enumerate all isomorphic
embeddings of a query graph q in a data graph G. An important branch of
matching algorithms exploit the backtracking search approach which recursively
extends intermediate results following a matching order of query vertices. It
has been shown that the matching order plays a critical role in time efficiency
of these backtracking based subgraph matching algorithms. In recent years, many …

arxiv learning model reinforcement learning