activity
20182026
most citedEfficient Bitruss Decomposition for Large-scale Bipartite Graphs

4 citations · 9 across the 12 of their papers we have counts for

collaborators

14 papers

cs.DB2026

Efficient -core Computation and On-the-fly Query at Billion Scale with GPUs

Qingshuai Feng, Shunyang Li, Kai Wang +3

In bipartite graphs, -core is a widely used model for cohesive subgraph mining. Specifically, an -core is a maximal subgraph in which each vertex in the upper layer h…

cs.DS2025

Efficient Computation of Hyper-triangles on Hypergraphs

Haozhe Yin, Kai Wang, Wenjie Zhang +3

Hypergraphs, which use hyperedges to capture groupwise interactions among different entities, have gained increasing attention recently for their versatility in effectively modelin…

cs.SI2025

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…

cs.CV2025★ 1 cited

ProbDiffFlow: An Efficient Learning-Free Framework for Probabilistic Single-Image Optical Flow Estimation

Mo Zhou, Jianwei Wang, Xuanmeng Zhang +5

This paper studies optical flow estimation, a critical task in motion analysis with applications in autonomous navigation, action recognition, and film production. Traditional opti…

cs.SI2025

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…

cs.LG2025★ 1 cited

On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing

Jianwei Wang, Kai Wang, Ying Zhang +3

Missing data imputation, which aims to impute the missing values in the raw datasets to achieve the completeness of datasets, is crucial for modern data-driven models like large la…