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

Jan. 28, 2022, 2:11 a.m. | Hanchen Wang, Ying Zhang, Lu Qin, Wei Wang, Wenjie Zhang, Xuemin Lin

cs.LG updates on arXiv.org arxiv.org

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

More from arxiv.org / cs.LG updates on arXiv.org

Data Analytics and Technical support Lead

@ Coupa Software, Inc. | Bogota, Colombia

Data Science Manager

@ Vectra | San Jose, CA

Data Analyst Sr

@ Capco | Brazil - Sao Paulo

Data Scientist (NLP)

@ Builder.ai | London, England, United Kingdom - Remote

Senior Data Analyst

@ BuildZoom | Scottsdale, AZ/ San Francisco, CA/ Remote

Senior Research Scientist, Speech Recognition

@ SoundHound Inc. | Toronto, Canada