31 citations · 57 across the 15 of their papers we have counts for
1 paper · 1 filter
Haida Zhang, Zengfeng Huang, Xuemin Lin +3
Driven by many real applications, we study the problem of seeded graph matching. Given two graphs G1=(V1,E1) and G2=(V2,E2), and a small set S of pre-matched node…