4 citations · 8 across the 9 of their papers we have counts for
6 papers · 1 filter
Motif Counting in Complex Networks: A Comprehensive Survey
Haozhe Yin, Kai Wang, Wenjie Zhang +3
Motif counting plays a crucial role in understanding the structural properties of networks. By computing motif frequencies, researchers can draw key insights into the structural pr…
Ensemble-based Deep Multilayer Community Search
Jianwei Wang, Yuehai Wang, Kai Wang +3
Multilayer graphs, consisting of multiple interconnected layers, are widely used to model diverse relationships in the real world. A community is a cohesive subgraph that offers va…
Efficient Unsupervised Community Search with Pre-trained Graph Transformer
Jianwei Wang, Kai Wang, Xuemin Lin +2
Community search has aroused widespread interest in the past decades. Among existing solutions, the learning-based models exhibit outstanding performance in terms of accuracy by le…
Neural Attributed Community Search at Billion Scale
Jianwei Wang, Kai Wang, Xuemin Lin +2
Community search has been extensively studied in the past decades. In recent years, there is a growing interest in attributed community search that aims to identify a community bas…
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…
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…