2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.LG2022
Scalable Motif Counting for Large-scale Temporal Graphs
Zhongqiang Gao, Chuanqi Cheng, Yanwei Yu +3
One fundamental problem in temporal graph analysis is to count the occurrences of small connected subgraph patterns (i.e., motifs), which benefits a broad range of real-world appli…
cs.DB2020★ 2 cited
Hierarchical Graph Matching Network for Graph Similarity Computation
Haibo Xiu, Xiao Yan, Xiaoqiang Wang +2
Graph edit distance / similarity is widely used in many tasks, such as graph similarity search, binary function analysis, and graph clustering. However, computing the exact graph e…