2 papers
cs.DB2026
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
Linglin Yang, Xunbin Su, Lei Zou +2
Subgraph matching is a fundamental problem in graph analysis with a wide range of applications. However, due to its inherent NP-hardness, enumerating subgraph matches efficiently o…
cs.LG2026
Towards Effective and Efficient Graph Alignment without Supervision
Songyang Chen, Youfang Lin, Yu Liu +2
Unsupervised graph alignment aims to find the node correspondence across different graphs without any anchor node pairs. Despite the recent efforts utilizing deep learning-based te…