Exact Graph Pattern Matching:Applications,Progress and Prospects

N37; Graph pattern matching(GPM)can be used to mine the key information in graphs.Exact GPM is one of the most commonly used methods among all the GPM-related methods,which aims to exactly find all subgraphs for a given query graph in a data graph.The exact GPM has been widely used in biological dat...

Full description

Saved in:
Bibliographic Details
Published in东华大学学报（英文版） Vol. 40; no. 2; pp. 216 - 224
Main Authors SUN Guohao, YU Shui, FANG Xiu, LU Jinhu
Format Journal Article
LanguageEnglish
Published School of Computer Science and Technology,Donghua University,Shanghai 201620,China 01.04.2023
Subjects
graph embedding
graph pattern matching(GPM)
exact matching
subgraph matching
subgraph isomorphism
Online AccessGet full text

Cover

More Information
Summary:N37; Graph pattern matching(GPM)can be used to mine the key information in graphs.Exact GPM is one of the most commonly used methods among all the GPM-related methods,which aims to exactly find all subgraphs for a given query graph in a data graph.The exact GPM has been widely used in biological data analyses,social network analyses and other fields.In this paper,the applications of the exact GPM were first introduced,and the research progress of the exact GPM was summarized.Then,the related algorithms were introduced in detail,and the experiments on the state-of-the-art exact GPM algorithms were conducted to compare their performance.Based on the experimental results,the applicable scenarios of the algorithms were pointed out.New research opportunities in this area were proposed.
ISSN:1672-5220
DOI:10.19884/j.1672-5220.202203006