97 citations · 217 across the 21 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.SI2018
Efficient Butterfly Counting for Large Bipartite Networks
Kai Wang, Xuemin Lin, Lu Qin +2
Bipartite networks are of great importance in many real-world applications. In bipartite networks, butterfly (i.e., a complete 2 x 2 biclique) is the smallest non-trivial cohesive…
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…