ENDNet: Extra-Node Decision Network for Subgraph Matching
Subgraph matching, which involves identifying a query graph within a larger data graph, is a fundamental problem that has applications in various fields. Although graph neural networks (GNNs) are commonly used in learning-based subgraph matching, they face challenges due to their convolution process...
Saved in:
| Main Authors: | Masaki Shirotani, Motoki Amagasaki, Masato Kiyama |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10891771/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
SymmPi: Exploiting Symmetry Removal for Fast Subgraph Matching
by: Yujiang Wang, et al.
Published: (2025-01-01) -
An efficient method for mining frequent weighted subgraphs based on weighted edges
by: Lam B. Q. Nguyen, et al.
Published: (2025-05-01) -
Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
by: Vladimir V. Vasilchikov
Published: (2022-03-01) -
An Efficient Vertex-Driven Temporal Graph Model and Subgraph Clustering Method
by: Hanlin Zhang, et al.
Published: (2022-01-01) -
A Dual-channel Progressive Graph Convolutional Network via subgraph sampling
by: Wenrui Guan, et al.
Published: (2024-07-01)