3 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.DB2025
NeuSO: Neural Optimizer for Subgraph Queries
Linglin Yang, Lei Zou, Chunshan Zhao
Subgraph query is a critical task in graph analysis with a wide range of applications across various domains. Most existing methods rely on heuristic vertex matching orderings, whi…
cs.DB2025
ShareDP: Finding k Disjoint Paths for Multiple Vertex Pairs
Zhiqiu Yuan, Youhuan Li, Lei Zou +1
Finding k disjoint paths (kDP) is a fundamental problem in graph analysis. For vertices s and t, paths from s to t are said to be disjoint if any two of them share no common vertex…