3 papers
cs.DB2025
Accelerating K-Core Computation in Temporal Graphs
Zhuo Ma, Dong Wen, Hanchen Wang +3
We address the problem of enumerating all temporal k-cores given a query time range and a temporal graph, which suffers from poor efficiency and scalability in the state-of-the-art…
cs.SI2025
WOCD: A Semi-Supervised Method for Overlapping Community Detection Using Weak Cliques
Shaozhen Ma, Hanchen Wang, Dong Wen +3
Overlapping community detection (OCD) is a fundamental graph data analysis task for extracting graph patterns. Traditional OCD methods can be broadly divided into node clustering a…
cs.DB2024
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…