SymmPi: Exploiting Symmetry Removal for Fast Subgraph Matching
Abstract Symmetry, a phenomenon of self-similarity, is common in many networks, which often incurs a lot of redundant accesses and computations, even duplicate results when executing graph matching tasks. Many approaches (e.g. symmetry-breaking methods) try to disrupt symmetry by translating symmetr...
Saved in:
| Main Authors: | Yujiang Wang, Ying Cao, Zhaobo Zhang, Pingpeng Yuan, Hai Jin |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2025-01-01
|
| Series: | Data Science and Engineering |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s41019-024-00271-w |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
ENDNet: Extra-Node Decision Network for Subgraph Matching
by: Masaki Shirotani, et al.
Published: (2025-01-01) -
Symmetry and symmetry breaking in science and arts
by: Klaus Mainzer
Published: (2022-12-01) -
An efficient method for mining frequent weighted subgraphs based on weighted edges
by: Lam B. Q. Nguyen, et al.
Published: (2025-05-01) -
High Performance Frequent Subgraph Mining on Transaction Datasets: A Survey and Performance Comparison
by: Bismita S. Jena, et al.
Published: (2019-09-01) -
CP-like symmetry with discrete and continuous groups and CP violation/restoration
by: Hiroshi Ohki, et al.
Published: (2024-10-01)