Showing cs.DBShow all
3 papers · 1 filter
cs.DB2026
RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning
Wei Huang, Hanchen Wang, Dong Wen +4
Identifying the most frequent induced subgraph of size in a target graph is a fundamental graph mining problem with direct implications for Web-related data mining and social n…
cs.DB2025
Accelerating Historical K-Core Search in Temporal Graphs
Zhuo Ma, Dong Wen, Kaiyu Chen +3
We study the temporal k-core component search (TCCS), which outputs the k-core containing the query vertex in the snapshot over an arbitrary query time window in a temporal graph.…
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…