1 citations · 2 across the 27 of their papers we have counts for
4 papers · 2 filters
Efficient Dynamic Attributed Graph Generation
Fan Li, Xiaoyang Wang, Dawei Cheng +3
Data generation is a fundamental research problem in data management due to its diverse use cases, ranging from testing database engines to data-specific applications. However, rea…
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 Influence Minimization via Node Blocking
Jinghao Wang, Yanping Wu, Xiaoyang Wang +4
Given a graph G, a budget k and a misinformation seed set S, Influence Minimization (IMIN) via node blocking aims to find a set of k nodes to be blocked such that the expected spre…
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs
Long Yuan, Kongzhang Hao, Xuemin Lin +1
Hop-constrained s-t simple path (HC-s-t path) enumeration is a fundamental problem in graph analysis. Existing solutions for this problem focus on optimizing the processing perform…