4 papers
HL-index: Fast Reachability Query in Hypergraphs
Peiting Xie, Xiangjun Zai, Yanping Wu +3
Reachability in hypergraphs is essential for modeling complex groupwise interactions in real-world applications such as co-authorship, social network, and biological analysis, wher…
Efficient Temporal Simple Path Graph Generation
Zhiyang Tang, Yanping Wu, Xiangjun Zai +3
Interactions between two entities often occur at specific timestamps, which can be modeled as a temporal graph. Exploring the relationships between vertices based on temporal paths…
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…