4 citations · 5 across the 2 of their papers we have counts for
3 papers
cs.SI2020★ 1 cited
Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs
Yizhang He, Kai Wang, Wenjie Zhang +2
We propose a novel cohesive subgraph model called -strengthened -core (denoted as -core), which is the first to consider both tie strength and vertex engagement…
cs.DB2020★ 4 cited
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
Kai Wang, Xuemin Lin, Lu Qin +2
Cohesive subgraph mining in bipartite graphs becomes a popular research topic recently. An important structure k-bitruss is the maximal cohesive subgraph where each edge is contain…
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…