7 papers
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 lay…
Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
Lingkai Meng, Long Yuan, Xuemin Lin +3
Bipartite graphs are commonly used to model relationships between two distinct entities in real-world applications, such as user-product interactions, user-movie ratings and collab…
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…
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…
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…