Subgraph Query Matching in Multi-Graphs Based on Node Embedding

Subgraph Query Matching in Multi-Graphs Based on Node Embedding

This paper presents an efficient algorithm for matching subgraph queries in a multi-graph based on features-based indexing techniques. The KD-tree data structure represents these nodes’ features, while the set-trie index data structure represents the multi-edges to make queries effectively. The vert...

Full description

Bibliographic Details
Main Authors: Muhammad Anwar, Aboul Ella Hassanien, Václav Snás̃el, Sameh H. Basha
Format: Article
Language:English
Published: MDPI AG 2022-12-01
Series:Mathematics
Subjects:
multigraph mining
pattern mining
matching problem
core number
KD-tree
node embedding
Online Access:https://www.mdpi.com/2227-7390/10/24/4830

Internet

https://www.mdpi.com/2227-7390/10/24/4830

Similar Items