1 citations · 3 across the 11 of their papers we have counts for
4 papers · 1 filter
SGND: An Effective Learning-Based Approach for Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (Technical Report)
Qi Wen, Xiang Lian, Nan Zhang +2
Subgraph similarity search over large-scale graphs is a fundamental task that retrieves subgraphs similar to a given query graph from a data graph, and it plays a crucial role in r…
S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics (Technical Report)
Qi Wen, Yutong Ye, Xiang Lian +1
For the past decades, the \textit{subgraph similarity search} over a large-scale data graph has become increasingly important and crucial in many real-world applications, such as s…
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings (Technical Report)
Yutong Ye, Xiang Lian, Nan Zhang +1
In many real-world applications such as social network analysis, knowledge graph discovery, biological network analytics, and so on, graph data management has become increasingly i…
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding (Technical Report)
Yutong Ye, Xiang Lian, Mingsong Chen
The classic problem of exact subgraph matching returns those subgraphs in a large-scale data graph that are isomorphic to a given query graph, which has gained increasing importanc…