21 citations · 22 across the 4 of their papers we have counts for
4 papers
AEDNet: Adaptive Edge-Deleting Network For Subgraph Matching
Zixun Lan, Ye Ma, Limin Yu +2
Subgraph matching is to find all subgraphs in a data graph that are isomorphic to an existing query graph. Subgraph matching is an NP-hard problem, yet has found its applications i…
A growth-fragmentation-isolation process on random recursive trees and contact tracing
Vincent Bansaye, Chenlin Gu, Linglong Yuan
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation…
Probabilities of large values for sums of i.i.d. non-negative random variables with regular tail of index
Matthias Birkner, Linglong Yuan
Let be i.i.d. non-negative random variables whose tail varies regularly with index , let be the sum and the largest of the first values. We cl…
Sub-GMN: The Neural Subgraph Matching Network Model
Zixun Lan, Limin Yu, Linglong Yuan +3
As one of the most fundamental tasks in graph theory, subgraph matching is a crucial task in many fields, ranging from information retrieval, computer vision, biology, chemistry an…