4 citations · 6 across the 8 of their papers we have counts for
8 papers
Constant-time Connectivity and 2-Edge Connectivity Querying in Dynamic Graphs
Lantian Xu, Junhua Zhang, Dong Wen +3
Connectivity query processing is a fundamental problem in graph processing. Given an undirected graph and two query vertices, the problem aims to identify whether they are connecte…
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
Yanping Wu, Renjie Sun, Xiaoyang Wang +4
Cohesive subgraph mining is a fundamental problem in bipartite graph analysis. In reality, relationships between two types of entities often occur at some specific timestamps, whic…
Efficient Antagonistic k-plex Enumeration in Signed Graphs
Lantian Xu, Rong-Hua Li, Dong Wen +3
A signed graph is a graph where each edge receives a sign, positive or negative. The signed graph model has been used in many real applications, such as protein complex discovery a…
AeonG: An Efficient Built-in Temporal Support in Graph Databases
Jiamin Hou, Zhanhao Zhao, Zhouyu Wang +4
Real world graphs are often dynamic and evolve over time. It is crucial for storing and querying graph evolution in graph databases. However, existing works either suffer from high…
Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems
Yuanhang Yu, Dong Wen, Ying Zhang +3
Matrix Factorization (MF) has been widely applied in machine learning and data mining. A large number of algorithms have been studied to factorize matrices. Among them, stochastic…
Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System
Xubo Wang, Lu Qin, Lijun Chang +3
Graph is a ubiquitous structure in many domains. The rapidly increasing data volume calls for efficient and scalable graph data processing. In recent years, designing distributed g…
Enumerating k-Vertex Connected Components in Large Graphs
Dong Wen, Lu Qin, Xuemin Lin +2
Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network…
I/O Efficient Core Graph Decomposition at Web Scale
Dong Wen, Lu Qin, Ying Zhang +2
Core decomposition is a fundamental graph problem with a large number of applications. Most existing approaches for core decomposition assume that the graph is kept in memory of a…