402 citations · 556 across the 19 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information
Haida Zhang, Zengfeng Huang, Xuemin Lin +3
Driven by many real applications, we study the problem of seeded graph matching. Given two graphs and , and a small set of pre-matched node…
cs.IR2018★ 3 cited
GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity Search
Yang Yang, Ying Zhang, Wenjie Zhang +1
In this paper, we study the problem of approximate containment similarity search. Given two records Q and X, the containment similarity between Q and X with respect to Q is |Q inte…